解题报告
题意：
略。
思路：
map应用。
#include <algorithm>
#include <iostream>
#include <cstring>
#include <cmath>
#include <queue>
#include <vector>
#include <cstdio>
#include <map>
using namespace std;
map<string,string>Map;
int main()
{
string str1,str2,str;
int i,j;
while(getline(cin,str))
{
str1.clear();
str2.clear();
if(str[0]==' ')break;
for(i=0;i<str.length();i++)
{
if(str[i]==' ')
break;
str1+=str[i];
}
str1[i]=' ';
for(j=i+1;j<str.length();j++)
str2+=str[j];
Map[str2]=str1;
}
while(cin>>str1)
{
if(!Map[str1].empty())
cout<<Map[str1]<<endl;
else cout<<"eh"<<endl;
}
return 0;
}We all know that FatMouse doesn't speak English. But now he has to be prepared since our nation will join WTO soon. Thanks to Turing we have computers to help him.
Input Specification
Input consists of up to 100,005 dictionary entries, followed by a blank line, followed by a message of up to 100,005 words. Each dictionary entry is a line containing an English word, followed by a space and a FatMouse word. No FatMouse word appears more than once in the dictionary. The message is a sequence of words in the language of FatMouse, one word on each line. Each word in the input is a sequence of at most 10 lowercase letters.
Output Specification
Output is the message translated to English, one word per line. FatMouse 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
Output for Sample Input
cat eh loops