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题目大意:给出一些字符串对,要求出入后面的字符串后要对应找到前面的字符串输出,未出现输出“eh".
解题思路:map的基本用法。
#include <iostream>
#include <string>
#include <stdio.h>
#include <map>
using namespace std;
const int N = 100;
int main() {
char str[N], aid[N], ans[N];
map<string, string> vec;
while (gets(str) && str[0] != '\0') {
sscanf(str, "%s%s", ans, aid);
vec[aid] = ans;
}
while(gets(aid)) {
if (vec.find(aid) == vec.end())
cout << "eh" << endl;
else
cout << vec[aid] << endl;
}
return 0;
}