问题 B: 【分治】Babelfish（map使用，字符串处理）

本文链接：https://blog.youkuaiyun.com/Spidy_harker/article/details/102373829

本文探讨了使用C++和标准模板库(map)解决Babelfish翻译问题的方法。通过读取字典条目和待翻译消息，实现从一种语言到另一种语言的翻译。对于字典中未出现的词汇，采用默认翻译策略。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

问题 B: 【分治】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 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 is the message translated to English, one word per line. Foreign words not in the dictionary should be translated as “eh”.
代码：

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

map<string,string>m;///即使是string到string的映射，char[]型的也可以使用

int main()
{
    char from[100],to[100],ori[100],target[100];
    while(cin.getline(ori,100)&&ori[0]!='\0')///ori[0]是不等于\0不是\n
    {
        sscanf(ori,"%s %s",to,from);///注意sscanf的用法
        m[from]=to;///char[]到char[]的映射
    }
    while(~scanf("%s",target))
    {
        if(m.find(target)!=m.end())
            cout<<m[target]<<'\n';
        else
            cout<<"eh"<<'\n';
    }
}