View Code of Problem 7

#include <stdio.h>
#include <malloc.h>
#define MAX 10000
int q[MAX];
int p[MAX];
int main()
{
    int t, n, m, a, b, temp, i, j, pos = 0, k;
    //int *p;//等式
	scanf("%d",&t);//T组输入
	for (i=0; i<t; i++)
    {
        scanf("%d", &n);//n行等式
        //p = (long long *)malloc(sizeof(long long)*n*2);
        for (j=0; j<n; j++)
        {
            scanf("%d=%d", &a, &b);
            p[j] = a;
            p[2*n-1-j] = b;
        }
        scanf("%d",&m);//m组数据
        for (j=0; j<m; j++)
        {
            scanf("%d",&temp);
            pos = 1;
            for (k=0; k<n*2; k++)
            {
                if (temp == p[k])
                {
                    printf("%d\n",p[2*n-1-k]);
                    pos = 0;
                    break;
                }
                if (pos)
                    printf("UNKNOW\n");
            }

        }
        printf("\n");
        //free(p);
    }
    return (0);
}