poj 2503 Babelfish

poj 2503 Babelfish

Babelfish Time Limit: 3000MS Memory Limit: 65536K Total Submissions: 34169 Accepted: 14666

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

Hint

Huge input and output,scanf and printf are recommended.

題意： 給出字典的英文與外語的對照，然後給出外語，輸出英語 題解： 裸的字典樹
代碼：

#include 
#include 
#include 
#include 
using namespace std;
const int Max=27;
const int maxn=811000;
struct node
{
    int sign;
    char str[20];
    int next[Max];
}a[maxn];
int cur=0;
void insert(char *s,char *t)
{
    int len,ans;
    int p=0;
    len=strlen(s);
    for(int i=0;i