Description
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".
这道题的基本题意为输入一个单词,然后翻译成对应的英语,这道题的难点在于如何循环结束,而且输入的字符串中包含空格。
源代码如下:
#include<bits/stdc++.h> using namespace std; string n,m; map<string,string>x; map<string,string>::iterator p; int main() { int i=0,j; char a[105],b[105],c[105]; while(gets(a)) { n=a; if(n=="")break; sscanf(a,"%s%s",b,c); x[c]=b; } while(cin>>c) if(x[c]!="")cout<<x[c]<<endl; else cout<<"eh"<<endl; }
这道题调试了好几遍才AC,但是掌握了好几个知识点,还知道了如何用双回车控制循环结束。