zoukankan      html  css  js  c++  java
  • What Are You Talking About (map)

    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(' '), enter(' ') 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<map>
    #include<string >
    using namespace std;
    int main()
    {
        map <string, string> mp;
        string str, temp;
        cin >> str;
        while (cin >> str && str != "END")
        {
            cin >> temp;
            mp[temp] = str;
        }
        cin >> str;
        getchar();
        while (getline(cin, str) && str != "END")
        {
            string st = "";
            for (int i = 0; i < str.length(); i++)
            {
                if (!isalpha(str[i]))
                {
                    map<string, string>::iterator p = mp.find(st);
                    if (p == mp.end()) cout << st;
                    else cout << mp[st];
                    cout << str[i];
                    st = "";
                }
                else
                    st += str[i];
            }
            cout << endl;
        }
        return 0;
    }

     利用map<string,string>解决;注意的是放在map中的first,second位置的不同,而引起的find的不同;

    灵活应用map

  • 相关阅读:
    RAM disk
    将2个物理磁盘做成4个逻辑卷
    LVM——基本概念
    服务器CPU架构演变过程
    IBM XIV
    011——一些貌似高逼格的词汇
    010——存储系统架构演变
    010——集群化
    009——虚拟化
    008——协议融合
  • 原文地址:https://www.cnblogs.com/kangdong/p/8453883.html
Copyright © 2011-2022 走看看