POJ 2503 Babelfish

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.

 

大致题意：

输入一个字典，字典格式为“英语 外语”的一一映射关系

然后输入若干个外语单词，输出他们的 英语翻译单词，如果字典中不存在这个单词，则输出“eh”

解题思路：

输入时再用map建立“外语 英语”的映射，输出时直接通过输入的字符查找对应的翻译，如果对应的字符串长度为 0 ， 输出eh，否则，输出对应的字符串

此外 要注意空行的处理

#include<map>
#include<stdio.h>
#include<string>
using namespace std;

int main()
{
    char english[11], foreign[11], str[30];
    map<string, string> translate; //记录foreign到engliash的映射

    for(;;){
        gets(str);
        if(str[0] == '
' || str[0] == '') {
            break;
        }
        sscanf(str, "%s%s", english, foreign);
        translate[foreign] = english;
    }

    while(scanf("%s", str) != EOF) {
        string s = translate[str];
        if(s.length() == 0) {
            printf("eh
");
        }
        else
            printf("%s
", s.c_str());
    }
    return 0;
}