poj 2503 Babelfish（字典树哈希）

Time Limit: 3000MS		Memory Limit: 65536K
Total Submissions: 29059		Accepted: 12565

Description

You have just moved from Waterloo to a big city. The people here speak an incomprehensible dialect of a foreign language. Fortunately, you have a dictionary to help you understand them.

Input

Input consists of up to 100,000 dictionary entries, followed by a blank line, followed by a message of up to 100,000 words. Each dictionary entry is a line containing an English word, followed by a space and a foreign language word. No foreign word appears more than once in the dictionary. The message is a sequence of words in the foreign language, one word on each line. Each word in the input is a sequence of at most 10 lowercase letters.

Output

Output is the message translated to English, one word per line. Foreign words not in the dictionary should be translated as "eh".

Sample Input

dog ogday
cat atcay
pig igpay
froot ootfray
loops oopslay

atcay
ittenkay
oopslay

Sample Output

cat
eh
loops

题意：给一个字典，输入若干个字符串，问再字典中与它对应的字符串，若没有输出“eh”;

#include<stdio.h>
#include<string.h>
#include<stdlib.h>
char s1[100010][20],s2[100010][20];

struct node
{
    int flag;
    struct node *next[26];
};
struct node* creat()
{
    struct node *p = (struct node *)malloc(sizeof(struct node));
    p->flag = 0;
    for(int i = 0; i < 26; i++)
        p->next[i] = NULL;
    return p;
}

void insert(struct node *p, char s[],int cnt)
{
    for(int i = 0; s[i]; i++)
    {
        if(p->next[s[i]-'a'] == NULL)
            p->next[s[i]-'a'] = creat();
        p = p->next[s[i]-'a'];
    }
    p->flag = cnt;
}
int search(struct node *p, char s[])
{
    for(int i = 0; s[i]; i++)
    {
        if(p->next[s[i]-'a'] == NULL)
           return -1;
        p = p->next[s[i]-'a'];
    }
    return p->flag;
}
int main()
{
    char s[20],str[20];
    int cnt = 0;
    struct node *root;
    root = creat();
    while(gets(s))
    {
        if(strcmp(s,"") == 0)
            break;
        sscanf(s,"%s %s",s1[cnt],s2[cnt]);
        insert(root,s2[cnt],cnt);
        cnt++;
    }
    while(scanf("%s",str)!= EOF)
    {
        int f = search(root,str);
        if(f == -1)
            printf("eh\n");
        else printf("%s\n",s1[f]);
    }
    return 0;
}