UVA 10282 Babelfish

Problem C: 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 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 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

Output for Sample Input

cat
eh
loops

题意： 每次输入2个单词。。一个代表原来的意思。。一个代表翻译过后的意思。。

输完之后 。。 输入一些单词。要输出原来的意思。，。如果找不到 就输出“eh”。。

思路：用map。。很轻松- - 

代码：

 

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

char sb[55];
char a[25], b[25];

int main()
{

    map<string, string> adj;
    while (gets(sb) && sb[0] != '\0')
    {
	sscanf(sb, "%s%s", a, b);
	adj[b] = a;
    }
    while (gets(a))
    {
	if (adj.find(a) == adj.end())
	    printf("eh\n");
	else
	    cout << adj[a] << endl;
    }
    return 0;
}