There are two groups of some numbers(0~50). each group should be input in a set(remove the duplicate numbers).
And then output the two set, intersection and union of the two set.
Input format:
first line: a couple of numbers and end of -1.
second line: a couple of numbers and end of -1.
Output format:
first line:Output the first set.
second line: Output the second set.
third line: Output the intersection of the two set.
fourth line:Output the union of the two set.
All the numbers in the set should be output by ascending oder.
Each line behind the numbers, there is a space ' '.
For example:
[Input]
1 2 3 6 5 4 1 2 3 -1
3 2 3 2 1 0 -1
[Output]
1 2 3 4 5 6
0 1 2 3
1 2 3
0 1 2 3 4 5 6
[Input]
0 -1
1 -1
[Output]
0
1
0 1
Hint:
部分代码可参考“Set and sort”
由于set是排好序的,所以可以将两个set的元素逐个进行比较:
如果,A的第一个比B的第一个小,输出A的第一个数,A的下标加1.
如果,A的第一个比B的第一个大,输出B的第一个数,B的下标加1.
如果,相等,输出任何一个,AB下标加1.
继续比较,直到一个下标等于其长度为止,输出另外一个set的剩余元素。
也可以用其他方法做。
建议使用函数。
为了去掉重复的 用到了桶排序