F - Babelfish解题报告（map函数）（陈渊）

F - Babelfish

Time Limit:3000MS     Memory Limit:65536KB     64bit IO Format:%I64d & %I64u

Submit  Status

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.

这个题目可以用到c++中的库函数map函数进行一对一的映射关系的建立，具体的关于map函数的用法，请见群共享。

#include<iostream>
#include<map>
#include<string>
using namespace std;
int main()
{
	map<string,string> search;//定义一个map函数 search
	char *a,*b;
	char line[1001];
	while(1)
	{
		gets(line);
		if(strlen(line)==0)
			break;
		a=strtok(line," ");//进行字符串的分割
		b=strtok(NULL," ");//进行字符串的分割
		search[string(b)]=string(a);//对相应的字符串进行标记
	}
	string word;
	while(cin>>word)
	{
		string result=search[word];//搜索单词
		if(result=="")
			result="eh";
		cout<<result<<endl;
	}
	return 0;
}