View Code of Problem 7

#include<stdio.h>
int main()
{
	int t,n,i,j,k,c;
	int a[10000],b[10000],s[10][10000],flag[10][10000],m[10];

	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[k]);				//输入需要判断的个数
		for ( i = 0; i < m[k]; i++)	
		{
			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[k] ; i++)
		{
			if ( flag[k][i] == 1)
				printf("%d\n",s[k][i]);
			else if ( flag[k][i] == 0 )
				printf("UNKONW\n");
			if ( k != t-1 && i == m[k]-1 )
				printf("\n");
		}			
	}
	return 0;
}