View Code of Problem 7

#include<stdio.h>
#define maxn 100005
int cas1,cas2,a[maxn],n,ta,tb;
void init()
{
    int i = 0;
    for(i;i < maxn;i ++)
        a[i] = 0;
}
int main(void)
{
    scanf("%d",&cas1);
    while(cas1--)
    {
        init();
        scanf("%d",&n);
        for(int i = 1;i <= n;i ++){
            scanf("%d=%d",&ta,&tb);
            a[ta] = tb;
            a[tb] = ta;
        }
        scanf("%d",&n);
        while(n --)
        {
            scanf("%d",&ta);
            if(a[ta]) printf("%d\n",a[ta]);
            else printf("UNKNOW\n");
        }
        printf("\n");
    }
}

Double click to view unformatted code.


Back to problem 7