zoukankan      html  css  js  c++  java
  • HDU 1075 What Are You Talking About (stl之map映射)

    What Are You Talking About
    Time Limit: 10000/5000 MS (Java/Others)    Memory Limit: 102400/204800 K (Java/Others)
    Total Submission(s): 28482    Accepted Submission(s): 9710


    Problem Description
    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?

    Input
    The 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.

    Output
    In 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!

    题意:将输入字符按照输入规则翻译
    分析:利用map构成映射,遇到标点或者空格时将前部分字母串翻译输出即可
     

    #include<iostream>
    #include<map>
    #include<cstdio>
    #include<string.h>
    #include<algorithm>
    using namespace std;
    int main()
    {
             string  s1,s2;
             cin>>s1;//START
             map<string,string>m;
             while(cin>>s1&&s1!="END")
                      cin>>s2,m[s2]=s1;
             cin>>s1;//START
             char s[3003];
             getchar();//去掉空行
             while(gets(s))//cin.getline(s,3003))
             {
                      if(!strcmp(s,"END"))
                               break;
                      int len=strlen(s);
                      s2="";
                      for(int i=0;i<len;i++)
                      {
                               if(s[i]>='a'&&s[i]<='z')
                                        s2+=s[i];
                               else
                               {
                                        if(m[s2]!="")//输出字符串
                                                 cout<<m[s2];
                                        else
                                                 cout<<s2;
                                        printf("%c",s[i]);//输出符号
                                        s2="";
                               }
                      }
                      printf("
    ");
             }
             return 0;
    }
  • 相关阅读:
    PHP mysqli_get_client_version() 函数
    PHP mysqli_get_client_stats() 函数
    两台服务器配置互信
    (转)SQL server 容易让人误解的问题之 聚集表的物理顺序问题
    DML操作对索引的影响
    sqlserver 常用语句
    聚集索引
    表扫描
    sqltext的参数化处理
    sqlserver的执行计划
  • 原文地址:https://www.cnblogs.com/aeipyuan/p/9893121.html
Copyright © 2011-2022 走看看