zoukankan      html  css  js  c++  java
  • HDU 1075 What Are You Talking About(map映照容器)(搜索)

    What Are You Talking About

    Time Limit: 10000/5000 MS (Java/Others)    Memory Limit: 102400/204800 K (Java/Others)
    Total Submission(s): 10593    Accepted Submission(s): 3367

    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!
    题意:用一本 火星文-英文 的字典,让你把一段火星文翻译出来,如果字典里没有则照放,空格、' ',' '标点符号也要输出。
     1 #include<iostream>
     2 #include<cstdio>
     3 #include<map>
     4 #include<cstring>
     5 using namespace std;
     6 bool Char(char c)
     7 {
     8     if(c>='A'&&c<='Z'||c>='a'&&c<='z')return 1;
     9     return 0;
    10 }
    11 int main()
    12 {
    13     map<string,string> mp;
    14     int i;
    15     char s[4000],ch;
    16     string s1,s2;
    17     cin>>s;
    18     while(~scanf("%s",s))
    19     {
    20         s1 = s;
    21         if(s1 == "END")break;
    22         scanf("%s",s);getchar();
    23         s2 = s;
    24         mp[s2] = s1;
    25     }
    26     cin>>s;getchar();//接受start和换行
    27     while(gets(s))
    28     {
    29         s1 = "";s1 = s;
    30         if(s1=="END")break;
    31         s1 = "";
    32         for(i=0; i<strlen(s); i++)
    33         {
    34             if(Char(s[i])){
    35                 s1 += s[i];
    36                 if(!Char(s[i+1])){//判断下一个字符
    37                     if(mp[s1]!="")//在字典里输出
    38                         cout<<mp[s1];
    39                     else
    40                         cout<<s1;
    41                     s1 = "";//清空字符串s1
    42                 }
    43             }
    44             else
    45                 printf("%c",s[i]);
    46         }
    47         puts("");
    48     }
    49     return 0;
    50 }
    View Code
  • 相关阅读:
    HDU 1160 FatMouse's Speed ——(DP)
    HDU 1114 Piggy-Bank ——(完全背包)
    poj 1458 Common Subsequence ——(LCS)
    HDU 1087 Super Jumping! Jumping! Jumping! ——(LIS变形)
    HDU 1257 最少拦截系统 ——(LIS)
    strrchr函数
    常用位操作
    Map中放置类指针并实现调用
    log4net 一分钟上手
    简单易懂的冒泡排序
  • 原文地址:https://www.cnblogs.com/qiu520/p/3254436.html
Copyright © 2011-2022 走看看