[Swust OJ 632]--集合运算(set容器)

 1 #include <iostream>
 2 #include <set>
 3 #include <string>
 4 #include <algorithm>
 5 #include <iterator>
 6 using namespace std;
 7 
 8 set<int>a, b, c, d, e, f, g;
 9 int n, m, x;
10 
11 void init(){
12     a.clear(); b.clear();
13     c.clear(); d.clear();
14     e.clear(); f.clear(); g.clear();
15 }
16 
17 void Order(string str, set<int>s){
18     cout << str << "={";
19     for (set<int>::iterator it = s.begin(); it != s.end(); it++){
20         if (it == s.begin()) cout << *it;
21         else cout << ", " << *it;
22     }
23     cout << "}" << endl;
24 }
25 int main(){
26     while (cin >> n){
27         init();
28         for (int i = 0; i < n; i++){
29             cin >> x;
30             a.insert(x);
31         }
32         cin >> m;
33         for (int i = 0; i < m; i++){
34             cin >> x;
35             b.insert(x);
36         }
37         set_union(a.begin(), a.end(), b.begin(), b.end(), insert_iterator<set<int> >(c, c.begin()));//并
38         set_intersection(a.begin(), a.end(), b.begin(), b.end(), insert_iterator<set<int> >(d, d.begin()));//交
39         set_difference(a.begin(), a.end(), b.begin(), b.end(), insert_iterator<set<int> >(e, e.begin()));//差
40         set_difference(c.begin(), c.end(), a.begin(), a.end(), insert_iterator<set<int> >(f, f.begin()));
41         set_difference(c.begin(), c.end(), b.begin(), b.end(), insert_iterator<set<int> >(g, g.begin()));
42         Order("A", a);
43         Order("B", b);
44         Order("AuB", c);
45         Order("AnB", d);
46         Order("A-B", e);
47         Order("SA", f);
48         Order("SB", g);
49     }
50     return 0;
51 }