1 #include <cstdio>
  2 #include <cstring>
  3 #include <iostream>
  4 #include <algorithm>
  5
  6
  7 using namespace std;
  8 const int maxn = 1e5 + 7;///范围
  9
 10 struct Hash_map
 11 {
 12
 13     static const int maxn = 2e5 + 7;///字符串的最大数量
 14     static const int MAXINT = 0x7FFFFFFF;
 15
 16     int first[maxn], sign;
 17
 18     struct Edge
 19     {
 20         int to, next;
 21         char *str, *ttr;
 22     } edge[maxn];
 23
 24     inline void init()
 25     {
 26         memset(first, -1, sizeof(first));
 27         sign = 0;
 28     }
 29
 30     inline int get_hash(char *str)
 31     {
 32         unsigned  long long h=0;
 33         while(*str)
 34         {
 35             h=(h<<4)+(*str++);
 36             long long g=h&0Xf0000000L;
 37             if(g)
 38                 h^=g>>24;
 39             h&=~g;
 40         }
 41         return h&MAXINT;
 42     }
 43
 44     inline void add_edge(int u, char *str, char *ttr)
 45     {
 46         int lens = strlen(str), lent = strlen(ttr);
 47         edge[sign].str = new char[lens + 1];
 48         edge[sign].ttr = new char[lent + 1];
 49         strcpy(edge[sign].str, str);
 50         strcpy(edge[sign].ttr, ttr);
 51         edge[sign].next = first[u];
 52         first[u] = sign ++;
 53     }
 54
 55     inline void Insert(char *str, char *ttr)
 56     {
 57         int key = get_hash(str) % (maxn);
 58         add_edge(key, str, ttr);
 59     }
 60
 61     inline bool Find(char *str)
 62     {
 63         int key = get_hash(str) % (maxn);
 64         for(int i = first[key]; ~i; i = edge[i].next)
 65         {
 66             if(!strcmp(str, edge[i].str))
 67             {
 68                 puts(edge[i].ttr);
 69                 return 1;
 70             }
 71         }
 72         puts("what?");
 73         return 0;
 74     }
 75 } T1;
 76
 77 char str[105], ttr[105], ktr[105];
 78 int n;
 79 int main()
 80 {
 81     T1.init();
 82
 83     while(scanf("%s",str)&&strcmp(str,"@END@")!=0)
 84     {
 85         int len=strlen(str);
 86         for(int i=0; i<len-1; i++)
 87             str[i]=str[i+1];
 88         str[len-2]='\0';
 89         getchar();
 90         gets(ttr);
 91         T1.Insert(str,ttr);
 92         T1.Insert(ttr,str);
 93
 94     }
 95     scanf("%d",&n);
 96     getchar();
 97     while(n--)
 98     {
 99         gets(ktr);
100         if(ktr[0]=='[')
101         {
102             int len=strlen(ktr);
103             for(int i=0; i<len-1; i++)
104                 ktr[i]=ktr[i+1];
105             ktr[len-2]='\0';
106
107         }
108         T1.Find(ktr);
109     }
110     return 0;
111
112
113 }