POJ 2503

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

可以采用 C++STL自带的 map 来完成。map容器在使用时包含头文件 #include<map>.在map容器中可以使用find函数找到关键字的位置。（以下代码未提交过）

<span style="font-size:12px;">#include<iostream>
#include<string>
#include<map>
using namespace std;
int main(){
	map<string, string> M;
	int i, n;
	cin >> n;
	string value, key;
	for (i = 0; i < n; i++){
		cin >> value >> key;
		M[key] = value;
	}
	map<string, string>::iterator it; 
	while (cin >> key){
		it = M.find(key);
		if (it == M.end())
			cout << "ef" << endl;
		else
			cout << it->second << endl;
	}
	return 0;
}
</span>