POJ 2503
发布日期:2021-06-30 15:31:09 浏览次数:2 分类:技术文章

本文共 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
using namespace std;int main(){ map
dic; map
flag; string word,foreign; char s1[20],s2[20]; char *p=s1,*q=s2; while(true) { scanf("%s",p); //输入第一个字符串 char temp=getchar(); if(temp=='\n') //若输入换行符直接跳出循环 break; scanf("%s",q); //输入第二个匹配的字符串 getchar(); word.assign(p,strlen(p)); //将字符串转化为string foreign.assign(q,strlen(q)); dic[foreign]=word; //第二个cmp flag[foreign]=true; //第一个cmp } foreign.assign(p,strlen(p));//第一个输入的放在p中 if(!flag[foreign]) cout << "eh" << endl; else cout << dic[foreign] << endl; while(cin >> foreign) { if(!flag[foreign]) cout << "eh" << endl; else cout << dic[foreign] << endl; } return 0;}
#include
#include
#include
using namespace std; int main(void){ char english[11],foreign[11]; map
appear; //记录foreign与engliash的配对映射是否出现 map
translate; //记录foreign到engliash的映射 /*Input the dictionary*/ while(true) { char t; //temporary if((t=getchar())=='\n') //判定是否输入了空行 break; else //输入english { english[0]=t; int i=1; while(true) { t=getchar(); if(t==' ') { english[i]='\0'; break; } else english[i++]=t; } } cin>>foreign; getchar(); //吃掉 输入foreign后的 回车符 appear[foreign]=true; translate[foreign]=english; } /*Translate*/ char word[11]; while(cin>>word) { if(appear[word]) cout<
<

 

转载地址:https://joycez.blog.csdn.net/article/details/83273281 如侵犯您的版权,请留言回复原文章的地址,我们会给您删除此文章,给您带来不便请您谅解!

上一篇:POJ 3253
下一篇:python使用过程中出现的问题

发表评论

最新留言

关注你微信了!
[***.104.42.241]2024年05月06日 01时17分10秒