What Are You Talking About HDU - 1075（二维数组）

What Are You Talking About HDU - 1075
Ignatius is so lucky that he met a Martian yesterday. But he didn’t know the language the Martians use. The Martian gives him a history book of Mars and a dictionary when it leaves. Now Ignatius want to translate the history book into English. Can you help him?
Input
The problem has only one test case, the test case consists of two parts, the dictionary part and the book part. The dictionary part starts with a single line contains a string “START”, this string should be ignored, then some lines follow, each line contains two strings, the first one is a word in English, the second one is the corresponding word in Martian’s language. A line with a single string “END” indicates the end of the directory part, and this string should be ignored. The book part starts with a single line contains a string “START”, this string should be ignored, then an article written in Martian’s language. You should translate the article into English with the dictionary. If you find the word in the dictionary you should translate it and write the new word into your translation, if you can’t find the word in the dictionary you do not have to translate it, and just copy the old word to your translation. Space(’ ‘), tab(’\t’), enter(’\n’) and all the punctuation should not be translated. A line with a single string “END” indicates the end of the book part, and that’s also the end of the input. All the words are in the lowercase, and each word will contain at most 10 characters, and each line will contain at most 3000 characters.
Output
In this problem, you have to output the translation of the history book.
Sample Input
START
from fiwo
hello difh
mars riwosf
earth fnnvk
like fiiwj
END
START
difh, i’m fiwo riwosf.
i fiiwj fnnvk!
END
Sample Output
hello, i’m from mars.
i like earth!

#include<algorithm>
#include<string.h>
#include<stdio.h>
char a[15],b[15],c[100000];
int tot;
int trie[1000000][26];
bool vis[1000000];
char ans[1000000][26];
void create(char *str)
{
    int root=0;   //每次都从树的根部开始
    while(*str)
    {
        int di=*str-'a';   
        if(trie[root][di]==0)  //等于0说明没有在树中输入
        {
            trie[root][di]=++tot;  //tot申请每一个节点
        }
        root=trie[root][di];   //root建立联系
        str++;
    }
    vis[root]=1;    //记录这个单词是否存在
    strcpy(ans[root],a);  //记录下这个单词，以root记录
}
int find(char *str)
{
    int root=0;  //从0开始
    while(*str)
    {
        int di=*str-'a';
        if(trie[root][di]==0)  //=0说明不存在这个单词
        {
            return 0;
        }
        root=trie[root][di];  //按照关系进行遍历
        str++;
    }
    if (vis[root])return root;  //如果存在，就输出root
    return 0;
}
int main()
{
    scanf("%s",a);
    tot=0;
    while(~scanf("%s",a)&&strcmp(a,"END"))
    {
        scanf("%s",b);
        create(b);  //进行建造树
    }
    scanf("%s",a);
    getchar();
    while(gets(c),strcmp(c,"END"))
    {
        int len=strlen(c);
        int v=0;
        for(int i=0; i<=len; i++)  //进行遍历
        {
            if(c[i]-'a'<0||c[i]-'a'>26||i==len) //如果等于这些说明
            {                     //到这里要断开，进行输出了
                a[v]='\0';         
                int u=find(a);   //进行查找
                v=0;    //v重新置0
                if(u)     
                    printf("%s",ans[u]); //存在输出这个单词
                else
                    printf("%s",a);  //不存在就输出原样单词
                if(i!=len)
                    printf("%c",c[i]);  //把这个断开的这个字母输出
            }
            else
                a[v++]=c[i];  //记录下现在的单词
        }
        printf("\n");
    }
}