UVA - 10282 Babelfish

最新推荐文章于 2020-04-20 17:35:55 发布

苏摩夜

最新推荐文章于 2020-04-20 17:35:55 发布

阅读量483

点赞数

分类专栏：哈希表文章标签： UVA - 10282 Babelfis

本文链接：https://blog.youkuaiyun.com/zz_FreeSky/article/details/40753377

版权

哈希表专栏收录该内容

7 篇文章

订阅专栏

本文介绍了如何使用一个简单的字典来解决在新城市中遇到的语言障碍问题，通过将不可理解的外国方言翻译成英语。主要通过编程实现，包括输入处理、字典匹配和输出生成等步骤。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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

题意：
给出英语单词，以及相应的方言；
然后再给出方言找出其对应的英语单词；
利用map 来做；

#include <iostream>
#include <cstdio>
#include <cstring>
#include <map>
#define N 100
using 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;
	}
}