UVA - 10282 Babelfish

来源：互联网发布：在淘宝网上买车可靠吗编辑：程序博客网时间：2024/05/17 07:05

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 ogdaycat atcaypig igpayfroot ootfrayloops oopslayatcayittenkayoopslay

Output for Sample Input

catehloops
题意：
给出英语单词，以及相应的方言；
然后再给出方言找出其对应的英语单词；
利用map 来做；
#include <iostream>#include <cstdio>#include <cstring>#include <map>#define N 100using namespace std;char str[N], t1[N], t2[N];map<string, string> Map;int main () {Map.clear();while (gets(str)) {if (str[0] == '\0') break;sscanf(str,"%s %s",t1,t2);Map[t2] = t1;}while (gets(str)) { if (Map.find(str) == Map.end()) printf("eh\n");else cout << Map[str]<<endl;}}

0 0