C++ 字典问题 map和sscanf的使用

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

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.

整体来说，问题用map解决，但本题的关键在于输入结束条件的控制。参考了uva 10282 Babelfish(STL map)，先获得字符数组，再判断字符数组首个字符是否为回车，如果不是则用sscanf（）函数输入。

#include <iostream>
#include <stdio.h>
#include<stdlib.h>
#include<map>
using namespace std;

int main()
{
    map<string,string>mp;
    char str[22],s1[11],s2[11];
    while(gets(str)&&str[0] != '\0')
    {
        sscanf(str,"%s %s",s1,s2);
        mp[s2]=s1;
    }
    while(gets(str))
    {
        if(mp.find(str)!=mp.end())
        {
            cout<<mp[str]<<endl;
        }
        else cout<<"eh"<<endl;
    }
    return 0;
}