View Code of Problem 7

#include<iostream>
#include<cstdio>
#include<map>

using namespace std;

map<int,int>my;
int c[1000];

int main()
{
    int t,h=0;
    cin>>t;
    for(int k=0;k<t;k++)
    {
        int n;
        cin>>n;
        for(int i=0;i<n;i++)
        {
            int a,b;
            scanf("%d=%d",&a,&b);
            my[a]=b;
            my[b]=a;
        }
        int m;
        cin>>m;
        for(int i=0;i<m;i++)
        {
            cin>>c[i];
        }
        for(int i=0;i<m-1;i++)
        {
            if(my.find(c[i])!=my.end())
                printf("%d\n",my[c[i]]);
            else
                printf("UNKNOW\n");
        }
        if(my.find(c[m-1])!=my.end())
            printf("%d",my[c[m-1]]);
        else
            printf("UNKNOW");
        my.clear();
        h++;
        if(h%2==0)
            cout<<endl;
    }
    return 0;
}