View Code of Problem 7

#include<iostream>
#include<map>
using namespace std;
int main() {
	int case_count;
	int rule_count;
	int query_count;
	int query;
	int a, b;
	map<int, int> dic;
	cin >> case_count;
	for (int i = 0; i< case_count; ++i) {
		cin >> rule_count;
		for (int j = 0; j<rule_count; ++j) {
			scanf("%d=%d", &a, &b);
			dic[a] = b;
			dic[b] = a;
		}
		cin >> query_count;
		for (int j = 0; j < query_count; ++j) {
			cin >> query;
			map<int, int>::iterator result = dic.find(query);
			if (result != dic.end())
				cout << result->second << endl;
			else cout << "UNKNOW" << endl;
		}
		cout << endl;
	}
	return 0;
}