2012 ACM/ICPC Asia Regional Tianjin Online hdu 4287 map和char[]的合作应用

Intelligent IMETime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 386    Accepted Submission(s): 203


Problem DescriptionInputOutputSample InputSample OutputSourceRecommend#include<stdio.h>#include<string.h>#include<string>#include<iostream>#include<map>using namespace std;char key[27]="22233344455566677778889999";char num[5005][10],word[5005][10];int main(){ int t; scanf("%d",&t); while(t--) { int n,m,i,j,len; map <string,int> M; scanf("%d%d",&n,&m); for(i=0;i<n;i++) { scanf("%s",num[i]); } map<string,int>::iterator it; for(i=0;i<m;i++) { scanf("%s",word[i]); len=strlen(word[i]); for(j=0;j<len;j++) word[i][j]=key[word[i][j]-'a']; it=M.find(word[i]); if(it==M.end()) M[word[i]]=1; else M[word[i]]++; } for(i=0;i<n;i++) { it=M.find(num[i]); if(it==M.end()) printf("0\n"); else printf("%d\n",M[num[i]]); } } return 0;}