poj2503用STL的map解决

先po题目

 

Babelfish

Time Limit: 3000MS		Memory Limit: 65536K
Total Submissions: 43032		Accepted: 18217

 

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

 

最近老师在STL的用法，布置了这道题给我练练手。题目不难，用map轻而易举的解决。在博客中已经装载了一个很详细的map用法，也可以在msdn查看用法。下面po这道题的解决代码：

 

从代码可以看出，这个程序不难，希望自己能够自己map的用法