《ACM程序设计》书中题目―B

Description

We all know that FatMouse doesn't speak English. But now he has to be prepared since our nation will join WTO soon. Thanks to Turing we have computers to help him.

Input Specification

Input consists of up to 100,005 dictionary entries, followed by a blank line, followed by a message of up to 100,005 words. Each dictionary entry is a line containing an English word, followed by a space and a FatMouse word. No FatMouse word appears more than once in the dictionary. The message is a sequence of words in the language of FatMouse, one word on each line. Each word in the input is a sequence of at most 10 lowercase letters.

Output Specification

Output is the message translated to English, one word per line. FatMouse 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

1、题意：就是让你每次输入一对字符串先输入英语然后隔一个空格输入兽语，最后只输入回车的时候表示输入结束，然后输入兽语，让你输出对应的英语，如果找不到便输出eh。

2、思路：使用map，然后让英语做key，兽语做内容，然后输入不用说，输入兽语，再查找英语然后输出即可。

3、代码：

#include<iostream>
#include<string>
#include<map>
using namespace std;
int main()
{
	map<string,string> a;
    string x,y,s;
    int i,j;
    while(getline(cin,s))
    {
        x.clear();
        y.clear();
        if(s[0]=='\0')break;
        for(i=0;i<s.length();i++)
        {
            if(s[i]==' ')
                break;
            x+=(s[i]);
        }
        for(j=i+1;j<s.length();j++)
            y+=(s[j]);
            a[y]=x;
    }
    while(cin>>y)
    {
        if(a[y]!="")
        cout<<a[y]<<endl;
        else cout<<"eh"<<endl;
    }
    return 0;
}

4、总结：使用map很容易便可以解决这道题。