What Are You Talking About hdu1075

#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
struct node
{
char word[11];
bool isTail;
node *next[26];
}memory[1000000],*root;
int cur;

node *build_node()
{
node *p=&memory[cur++];
for(int i=0;i<26;i++)
p->next[i]=NULL;
p->isTail=false;
return p;
}

void insert_tree(char *s1,char *s2)
{
int len=strlen(s1);
node *p=root;
for(int i=0;i<len;i++)
{
if(p->next[s1[i]-'a']==NULL)
p->next[s1[i]-'a']=build_node();
p=p->next[s1[i]-'a'];
}
p->isTail=true;
strcpy(p->word,s2);
}

char *query(char *s)
{
int len=strlen(s);
node *p=root;
for(int i=0;i<len;i++)
{
if(p->next[s[i]-'a']==NULL)
return NULL;
p=p->next[s[i]-'a'];
}
if(p->isTail!=NULL)
return p->word;
else
return NULL;
}

int main()
{
char s1[15],s2[15],s[3005],*p,*q;
int i;
bool state;
cur=0;
root=build_node();
gets(s1);//读"START"
//建字典树
while(scanf("%s",s1))
{
if(s1[0]=='E')
break;
scanf("%s",s2);
insert_tree(s2,s1);
}

//翻译
getchar();//处理最后一个‘\n'。
gets(s2);//读"START"
while(gets(s))
{
if(s[0]=='E')
break;
p=s;
i=0;
while(*p)
{
if(*p<='z'&&*p>='a')
{
state=true;//在单词中
s1[i++]=*p;
}
else if(state==true)
{
state=false;//出了单词
s1[i]='\0';
i=0;
if((q=query(s1))==NULL)
printf("%s",s1);
else
printf("%s",q);
putchar(*p);
}
else
putchar(*p);
p++;
}
putchar('\n');
}
return 0;
}