poj 2503 Babelfish (查找 map)

#include <iostream>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<stack>
#include<queue>
#include<iomanip>
#include<cmath>
#include<algorithm>
#include<map>
using namespace std;

char str[200010][30];
int main()
{
int i,j;
char s1[30];
map<string,int>mp;
i=1;
while(1)
{
char t; j=0;
if((t=getchar())=='\n')
break;
str[i][j++]=t;
while(1)
{
t=getchar();
if(t==' ')
{
str[i][j]='\0';
break;
}
else
str[i][j++]=t;
}
scanf("%s",s1);
mp[s1]=i;
i++;
getchar();
}
while(gets(s1)!=NULL)
{
if(mp[s1]>=1)
printf("%s\n",str[mp[s1]]);
else
printf("eh\n");
}
return 0;
}