POJ 2503 Babelfish （STL）

題目連接

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

分析：
給定一些單詞以及每一個單詞對應的意思，這之間是一一對應的。而後詢問某一個單詞對應的意思是什麼，若是有對應的意思的話，就把對應的意思輸出來，不然輸出「eh」。

代碼：

#include <iostream>
#include <string>
#include <map>
#include<stdio.h>
using namespace std;
map <string,string>mp;
int main ()
{
    char ch[30],str1[15],str2[15];
    while (gets(ch))
    {
        if (ch[0]==0)
            break;
        sscanf(ch,"%s%s",str1,str2);
        mp[str2]=str1;
    }
    while (gets(ch))
    {
        map<string,string>::iterator it;
        it=mp.find(ch);
        if (it!=mp.end())
            cout<<(*it).second<<endl;
        else
            printf("eh\n");
    }
    return 0;
}