View Code of Problem 7

#include<stdio.h>

int main()
{
	int T,n,m,flag;
	int a[100000][2];
	int s[100000]  ;
	scanf("%d", &T);	
		while (T--)
		{
			a[100000][2] = -1;
			s[100000] = -1;
			scanf("%d", &n);
			for (int i = 0; i < n; i++)
			{
				scanf("%d=%d", &a[i][0], &a[i][1]);
			}
			scanf("%d", &m);
			for (int i = 0; i < m; i++)
			{
				scanf("%d", &s[i]);
			}
			flag = 0;
			for (int i = 0; i < m; i++)
			{
				for (int j = 0; j < n; j++)
			{
					if (s[i] == a[j][0]) 
					{ 
						printf("%d\n", a[j][1]);
						flag = 1;
					break;
					}
				else if (s[i] == a[j][1])
				{
					printf("%d\n", a[j][0]);
 						flag = 1;
 						break;
 					}
 					else
 					{
 						flag = 0;
 					}
 				}
 				if (flag==0)
 				{
 					printf("UNKNOW\n");
 				}
 			}
 			printf("\n");
 		}
 	return 0;
 }