Babelfish

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#include<cstdio>
#include<cstring>
#include<map>
#include<string>

using namespace std;

map<string, string> ma;
map<string, string>::iterator it;

char str1[11], str2[11], str[22];
int main(){
    while(gets(str) && str[0]){
        sscanf(str,"%s%s", str1, str2);
        ma[str2] = str1;
    }
    while(scanf("%s", str1) != EOF){
        it = ma.find(str1);                 //  用于查找，查找，茶渣
        if(it == ma.end()) printf("eh\n");
        else printf("%s\n", it->second.c_str());
    }
    return 0;
}

Babelfish （map 用法。<string, string>

声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉：投诉/举报工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。

联系
我们