Language of FatMouse(输入输出格式+STL的map)

Link:http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=1109

ZOJ Problem Set - 1109

Language of FatMouse

---

Time Limit: 10 Seconds       Memory Limit: 32768 KB

---

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

---

Source:  Zhejiang University Training Contest 2001

#include<iostream>
#include<sstream>
#include<algorithm>
#include<map>
#include<cstdio>
#include<cstring>
using namespace std;
const int maxn=33;
map<string,string>entry;
string value,key;
map<string,string>::iterator loc;
int main()
{
	char line[maxn];
	while(gets(line))
	{
		if(strlen(line)==0)
		{
			break;
		}
		char english[maxn],mouse[maxn];
		sscanf(line,"%s%s",english,mouse);
		key=mouse;
		value=english;
		entry[key]=value;
	}
	char words[maxn];
	while(~scanf("%s",words))
	{
		loc=entry.find(words);
		if(loc!=entry.end())
	    //cout<<entry[words]<<endl;
	    cout<<(*loc).second<<endl;//注意：输出只能用cout，不能用printf！！！ 
		else
		printf("eh\n");
	}
}