POJ2503 Babelfish map或者hash_map

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<string.h>
#include<cmath>
#include<vector>
#include<algorithm>
using namespace std;
const int maxn=1e+6;
const int P=999983;
unsigned int base[100];
int dic[maxn];
char eng[100010][11];
inline void  init_hash(char* s,int h[])
{
 int l=strlen(s);
 h[0]=0;
 for(int i=1;i<=l;++i)
 	{
 	 h[i]=(h[i-1]*26+s[i-1])%P;
	}
 base[0]=0;
 for(int i=1;i<=l;i++)
 	base[i]=(base[i-1]*26)%P;
}

inline unsigned int string_hash(char* s,int h[], int l, int r)//[l,r)左闭右开 
{
 init_hash(s,h);
 return (h[r]-h[l]*base[r-1])%P;
}
 int ha[maxn];
int main()
{freopen("t.txt","r",stdin);
 //ios::sync_with_stdio(false);
 memset(dic,0,sizeof(dic));
 char lan[11];
 int ditlen=1,tot=0;
 eng[0][0]=‘e‘;
 eng[0][1]=‘h‘;
 eng[0][3]=‘\0‘;
 while(true)
 	{
 	 char t=getchar();
 	 if(t==‘\n‘)break;
 	 int len=1;
 	 eng[ditlen][0]=t;
 	 while(true)
 	 	{
 	 	 t=getchar();
 	 	 if(t==‘ ‘){eng[ditlen][len++]=‘\0‘;ditlen++;break;}
 	 	 eng[ditlen][len++]=t;
		}
	 int lent=0;
	 while(true)
	 	{
	 	 t=getchar();
	 	 if(t==‘\n‘){lan[lent++]=‘\0‘;break;}
	 	 lan[lent++]=t;
		}
	 int leng=strlen(lan);
	 int has=string_hash(lan,ha,0,leng);
	 while(has<0)has+=P;
	 dic[has]=ditlen-1;
	}
 while(scanf("%s",lan)!=EOF)
 	{
 	 int has=string_hash(lan,ha,0,strlen(lan));
 	  while(has<0)has+=P;
 	 has=dic[has];
 	 for(int i=0;;i++)
 	 	{
 	 	 if(eng[has][i]==‘\0‘)break;
 	 	 printf("%c",eng[has][i]);
		}
	 printf("\n");
	}	
 return 0;
}