poj-2503

#include<cstdio>
#include<iostream>
#include<queue>
#include<string>
#include<cstring>
#include<algorithm>
using namespace std;
char str[50];
char str1[11];
char str2[11];
string temp;
const int maxn = 1000100;
struct trie
{
    int ch[maxn][26],sz,root;
    string inf[maxn];
    int newnode(){
        inf[sz] = "eh";
        memset(ch[sz],0,sizeof(ch[sz]));
        return sz++;
    }
    void init(){
        sz = 0;
        root = newnode();
    }
void insert(char *str1,char* str2){
    int length = strlen(str1);
    int now = root;
    for(int i = 0;i < length;i++){
        int &temp = ch[now][str1[i] - ‘a‘];
        if(!temp){
            temp = newnode();
        }
        now = temp;
    }
    inf[now] = str2;
}

void query(char *str)
{
    int len = strlen(str);
    int now = root;
    for(int i = 0;i < len;i++){
        now = ch[now][str[i]-‘a‘];
        int tmp = now;
        if(!tmp)
        {
            temp = "eh";
            return;
        }
       else
       {
           now = tmp;
       }
    }
    temp = inf[now];
}
}tr;

int main(){
    tr.init();
  while(gets(str)&&str[0]){
        sscanf(str,"%s%s",str2,str1);
        tr.insert(str1,str2);
    }

    while(scanf("%s",str) != EOF){
        tr.query(str);
       cout << temp << endl;
    }
    return 0;
}