POJ 2503

失去斗志的菜鸟

于 2018-10-22 15:51:08 发布

阅读量4.1k

点赞数 1

CC 4.0 BY-SA版权

分类专栏： # POJ

本文链接：https://blog.csdn.net/qq_40421671/article/details/83273281

POJ 专栏收录该内容

169 篇文章

订阅专栏

本文介绍了一道名为Babelfish的编程题，题目要求根据给定的字典将一种外语翻译成英语，对于字典中未列出的词汇则统一翻译为eh。文章提供了两种解题思路及代码实现，主要利用了C++中的map数据结构。

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 ogday
cat atcay
pig igpay
froot ootfray
loops oopslay

atcay
ittenkay
oopslay

Sample Output

cat
eh
loops

Hint

Huge input and output,scanf and printf are recommended.

Source

Waterloo local 2001.09.22

大致题意：

输入一个字典，字典格式为“英语 -> 外语”的一一映射关系

然后输入若干个外语单词，输出他们的英语翻译单词，如果字典中不存在这个单词，则输出“eh”

解题思路：

第一次使用map,并且使用到了char数组到string转化的函数assign。

这道题的难点在于，判断输入。下面有两种方法。

代码：

#include <iostream>
#include <cstring>
#include <cstdio> 
#include <map>
using namespace std;

int main()
{ 
    map<string,string> dic;
    map<string,bool> 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<iostream>
#include<string>
#include<map>
using namespace std;
 
int main(void)
{
    char english[11],foreign[11];
 
    map<string,bool>appear;  //记录foreign与engliash的配对映射是否出现
    map<string,string>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<<translate[word]<<endl;
        else
            cout<<"eh"<<endl;
    }
 
    return 0;
}