Description
You have just moved from Waterloo to a big city. The people here speak an incomprehensible dialect of a foreign language. Fortunately, you have a dictionary to help you understand them.
Input
Input consists of up to 100,000 dictionary entries, followed by a blank line, followed by a message of up to 100,000 words. Each dictionary entry is a line containing an English word, followed by a space and a foreign language word. No foreign word appears more than once in the dictionary. The message is a sequence of words in the foreign language, one word on each line. Each word in the input is a sequence of at most 10 lowercase letters.
Output
Output is the message translated to English, one word per line. Foreign words not in the dictionary should be translated as "eh".
Sample Input
dog ogday cat atcay pig igpay froot ootfray loops oopslay atcay ittenkay oopslay
Sample Output
cat eh loops
Hint
Huge input and output,scanf and printf are recommended.
#include
#include
#include
#include
using namespace std;
const int maxn=100010;//数量
struct node
{
char e[60],s[60];
}dic[maxn]; //字典条目
char t[20]; //需要翻译的字符
int pos;
bool cmp(struct node a,struct node b)
{
return strcmp(a.s,b.s)<0;//按字符串大小排序
}
int search(char s[])//二分查找
{
int l=0,r=pos-1;
while(l<=r)
{
int mid=(l+r)/2;
if(strcmp(dic[mid].s,s)==0)
return mid;
else if(strcmp(dic[mid].s,s)>0)
r=mid-1;
else l=mid+1;
}
return -1;
}
int main()
{
pos=0;
char z;
while(scanf("%s%c",&dic[pos].e,&z)!=EOF)//输入字典条目
{
if(z=='\n')
{
strcpy(t,dic[pos].e);
break;
}
scanf("%s",&dic[pos++].s);
}
sort(dic,dic+pos,cmp);
int num=search(t);
if(num>=0)
{
printf("%s\n",dic[num].e);
}
else
printf("eh\n");
while(scanf("%s",&t)!=EOF)
{
num=search(t);
if(num>=0)
{
printf("%s\n",dic[num].e);
}
else
printf("eh\n");
}
return 0;
}