View Code of Problem 7

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

Double click to view unformatted code.


Back to problem 7