本文共 2905 字,大约阅读时间需要 9 分钟。
Babelfish
Time Limit: 3000MS | Memory Limit: 65536K | |
Total Submissions: 49919 | Accepted: 20820 |
Description
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 ogdaycat atcaypig igpayfroot ootfrayloops oopslayatcayittenkayoopslay
Sample Output
catehloops
Hint
Huge input and output,scanf and printf are recommended.
Source
大致题意:
输入一个字典,字典格式为“英语 -> 外语”的一一映射关系
然后输入若干个外语单词,输出他们的 英语翻译单词,如果字典中不存在这个单词,则输出“eh”
解题思路:
第一次使用map,并且使用到了char数组到string转化的函数assign。
这道题的难点在于,判断输入。下面有两种方法。
代码:
#include#include #include #include
#include#include #include
转载地址:https://joycez.blog.csdn.net/article/details/83273281 如侵犯您的版权,请留言回复原文章的地址,我们会给您删除此文章,给您带来不便请您谅解!