通用版2.B

最新推荐文章于 2024-04-19 09:00:00 发布

原创最新推荐文章于 2024-04-19 09:00:00 发布 · 166 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#map

stl 专栏收录该内容

3 篇文章

订阅专栏

本文介绍了一个有趣的编程问题：使用C++实现火星文到英文的翻译。通过读取输入文件中的字典部分和文章部分，利用标准输入输出进行交互，实现了字符串的匹配与翻译功能。

Ignatius is so lucky that he met a Martian yesterday. But he didn't know the language the Martians use. The Martian gives him a history book of Mars and a dictionary when it leaves. Now Ignatius want to translate the history book into English. Can you help him?

InputThe problem has only one test case, the test case consists of two parts, the dictionary part and the book part. The dictionary part starts with a single line contains a string "START", this string should be ignored, then some lines follow, each line contains two strings, the first one is a word in English, the second one is the corresponding word in Martian's language. A line with a single string "END" indicates the end of the directory part, and this string should be ignored. The book part starts with a single line contains a string "START", this string should be ignored, then an article written in Martian's language. You should translate the article into English with the dictionary. If you find the word in the dictionary you should translate it and write the new word into your translation, if you can't find the word in the dictionary you do not have to translate it, and just copy the old word to your translation. Space(' '), tab('\t'), enter('\n') and all the punctuation should not be translated. A line with a single string "END" indicates the end of the book part, and that's also the end of the input. All the words are in the lowercase, and each word will contain at most 10 characters, and each line will contain at most 3000 characters.
OutputIn this problem, you have to output the translation of the history book.
Sample Input

START
from fiwo
hello difh
mars riwosf
earth fnnvk
like fiiwj
END
START
difh, i'm fiwo riwosf.
i fiiwj fnnvk!
END

Sample Output

hello, i'm from mars.
i like earth!

Hint

Huge input, scanf is recommended.

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

int main()
{
    int i,n;
    char q[3030];
    map<string,string>mars;
    string a,b;
    cin>>a;
    while(cin>>a){
        if(a=="END")break;
        cin>>b;
        mars[b]=a;
    }
    cin>>a;
    getchar();
    while(gets(q)){
        b="";
        if(strcmp(q,"END")==0)break;
        n=strlen(q);
        for(i=0;i<=n-1;i++){
            if(q[i]>='a'&&q[i]<='z'){
                b+=q[i];
            }else
            {
                if(mars[b]!=""){
                    cout<<mars[b];
                }else
                {
                    cout<<b;
                }
                b="";
                cout<<q[i];
            }
        }
        cout<<endl;
    }
    return 0;
}

用map容器使字符串和字符串一一对应，用一个临时数组记录一个火星单词，然后判断这个火星单词有没有对应的英文单词，如果有就输出英文单词，如果没有就输出这个火星单词，然后如果是标点符号或空格的话也要输出