字典树模板题 POJ 2503

 #include <cstdio>
 #include <cstring>

 char en[],fr[];
 int st;
 struct Tire{
     int next[];
     char eng[];
 }node[];
 void insert(char *s,int cur)
 {
     if(*s){
         if(!node[cur].next[*s-'a'])
             node[cur].next[*s-'a']=++st;
         insert(s+,node[cur].next[*s-'a']);
     }
     else strcpy(node[cur].eng,en);
 }
 void search(char *s,int cur)
 {
     if(*s){
         if(!node[cur].next[*s-'a']){
             printf("%s\n","eh");
             return;
         }
         search(s+,node[cur].next[*s-'a']);
     }
     else printf("%s\n",node[cur].eng);
 }
 int main()
 {
     char str[];
     while(gets(str)&&str[]){
         sscanf(str,"%s%s",en,fr);
         insert(fr,);
     }
     while(scanf("%s",fr) != EOF){
         search(fr,);
     }
     return ;
 }