OJ刷题记录：集合的运算 题目编号:456

#include <iostream>

#define MaxSize 20

using namespace std;

bool isFindOf(int* arr, int len, int val) {
	bool isFind = false;
	
	for (int i = 0; i < len; i++) {
		if (arr[i] == val) {
			isFind = true;
			break;
		} 
	}
	
	return isFind;
}

int main() {
	int A[MaxSize], B[MaxSize];
	int lenA, lenB;
	char command;
	
	while (cin >> command) {
		if (command == 'E') break;
		
		switch (command) {
			case 'A':
				cin >> lenA;
				for (int i = 0; i < lenA; i++) {
					cin >> A[i];
				}
				break;
				
			case 'B':
				cin >> lenB;
				for (int i = 0; i < lenB; i++) {
					cin >> B[i];
				}
				break;
				
			case 'U':
				for (int i = 0; i < lenA; i++) {
					cout << A[i] << endl; 
				}
				for (int i = 0; i < lenB; i++) {
					if (!isFindOf(A, lenA, B[i]))
						cout << B[i] << endl;
				}
				break;
				
			case 'I':
				for (int i = 0; i < lenA; i++) {
					if (isFindOf(B, lenB, A[i]))
						cout << A[i] << endl;
				}
				break;
		}
	}
	
	return 0;
}