poj2503 map构建字典树

最新推荐文章于 2021-11-09 00:34:21 发布

原创最新推荐文章于 2021-11-09 00:34:21 发布 · 406 阅读

0 ·

CC 4.0 BY-SA版权

字符串--字典树同时被 2 个专栏收录

4 篇文章

订阅专栏

STL

3 篇文章

订阅专栏

本文介绍了一个基于字典映射的简单翻译程序，该程序使用C++实现，能够将一种语言（如外语）翻译成另一种语言（如英语）。通过逐字符读取输入并利用map数据结构存储词汇对应关系，程序能有效处理输入数据，对于未出现在字典中的词汇则默认输出为eh。

题解：用map很简单的。只是输入很有问题，用scanf反正我是没写运行成功。于是一个字符一个字符的输入。。

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

map<string,string> qq;
map<string,int> p;

char a[1001],b[1001],c[1001];

int main()
{
    while(1)
    {

        char t;
        if((t=getchar())=='\n')
          break;
        else
        {
            int i=0,j=0;
            a[i++]=t;
            while(1)
            {
               t=getchar();
               if(t==' ')
                  {
                    a[i]='\0';
                    break;
                  }
                else
                   a[i++]=t;
            }
        }
        scanf("%s",b);
        getchar();
        qq[b]=a;
        p[b]=1;
    }
    while(scanf("%s",c)!=EOF)
    {
        if(p[c])
            cout<<qq[c]<<endl;
        else
            printf("eh\n");
    }
    return 0;
}

Babelfish

Time Limit: 3000MS		Memory Limit: 65536K
Total Submissions: 32988		Accepted: 14189

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