L12Y2005

#include "stdafx.h"
#include <iostream>
#include <set>
#include <algorithm>
#include <iterator>
using namespace std;

int main()
{
    set<int> number8;
    set<int> number15;
    set<int> number45;

    set<int> temp;

    for (int i = 30; i <= 150; i++) {
        if (i % 8 == 0) {
            number8.insert(i);
        }
        if (i % 15 == 0) {
            number15.insert(i);
        }
        if (i % 45 == 0) {
            number45.insert(i);
        }
    }

    set<int> association;
    set<int> intersection;
    set_intersection(number8.begin(), number8.end(), number15.begin(), number15.end(), inserter(temp, temp.begin()));
    set_intersection(number45.begin(), number45.begin(), temp.begin(), temp.end(), inserter(intersection, intersection.begin()));

    temp.clear();

    set_union(number8.begin(), number8.end(), number15.begin(), number15.end(), inserter(temp, temp.begin()));
    set_union(number45.begin(), number45.begin(), temp.begin(), temp.end(), inserter(association, association.begin()));

    cout << "Association: ";
    copy(association.begin(), association.end(), ostream_iterator<int>(cout, " "));

    cout << "\nIntersection: ";
    copy(intersection.begin(), intersection.end(), ostream_iterator<int>(cout, " "));
    cout << "there is no number";

    return 0;
}