hdu4287 Intelligent IME-----天津网络赛

Intelligent IME

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 495    Accepted Submission(s): 260

Problem DescriptionInputOutputSample InputSample OutputSourceRecommend#include<iostream>#include<cstdlib>#include<stdio.h>#include<memory.h>#include<string.h>#define mm 1000007using namespace std;char ss[5010][10];struct hashtable{ int h[mm],next[mm],size,num[mm]; char sty[mm][10]; int ELFHash(char *str){ unsigned long h=0; while(*str!='\0') { h=(h<<4)+(*str);str++; unsigned long g=h&0xf0000000L; if(g!=0) h^g>>24; h&=~g; } return h%mm;} void insert(char *s) { int key=ELFHash(s); for(int i=h[key];i>=0;i=next[i]) if(!strcmp(sty[i],s)){num[i]++;return ;} num[size]=1;next[size]=h[key];h[key]=size;strcpy(sty[size],s);size++; } int find(char *s) { int key=ELFHash(s); for(int i=h[key];i>=0;i=next[i]) if(!strcmp(sty[i],s)) return num[i]; return 0; } void clear() { memset(h,-1,sizeof(h)); size=0; }}g;int main(){ int t,n,m; char s[550]; s['a']=s['b']=s['c']='2'; s['d']=s['e']=s['f']='3'; s['g']=s['h']=s['i']='4'; s['j']=s['k']=s['l']='5'; s['m']=s['n']=s['o']='6'; s['p']=s['q']=s['r']=s['s']='7'; s['t']=s['u']=s['v']='8'; s['w']=s['x']=s['y']=s['z']='9'; scanf("%d",&t); while(t--) { scanf("%d%d",&n,&m); for(int i=0;i<n;i++) scanf("%s",ss[i]); char tt[10]; g.clear(); for(int i=0;i<m;i++) { scanf("%s",tt); for(int j=0;j<strlen(tt);j++) { tt[j]=s[tt[j]]; } g.insert(tt); } for(int i=0;i<n;i++) { int ans=g.find(ss[i]); cout<<ans<<endl; } }}/*13 5466444874goinnightmightgn*/