View Code of Problem 7

#include<stdio.h>
int main()
{
	int t,n,m,i,j,k,c;
	int a[10000],b[10000],s[10][10000],flag[10][10000];
	scanf("%d",&t);
	for (k = 0; k < t; k++)
	{
		scanf("%d",&n);
		for ( i = 0; i < n ; i++)
			scanf("%d=%d",&a[i],&b[i]);
		scanf("%d",&m);
		for ( i = 0; i < m; i++)	//ÊäÈëµÄµÚm¸öÊý
		{
			scanf("%d",&c);
			flag[k][i] = 1;
			for ( j = 0; j < n; j++)	//²éÕÒ
				if ( c == a[j])
				{
					flag[k][i] = 1;
					s[k][i] = b[j];
					break;
				}
				else if ( c == b[j])
				{
					flag[k][i] = 1;
					s[k][i] = a[j];
					break;
				}
				else
					flag[k][i] = 0;
		}
	}
	for (k = 0; k < t; k++)
	{
		for ( i = 0; i < m ; i++)
		{
			if ( flag[k][i] == 1)
				printf("%d",s[k][i]);
			else if ( flag[k][i] == 0 )
				printf("UNKONW");
			if ( k != t-1 || i != m-1 )
				printf("\n");
		}			
	}
	return 0;
}