zoukankan      html  css  js  c++  java
  • hdoj1075 What Are You Talking About

    What Are You Talking About

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


    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容器写的嘎嘎 ,写了两天,累死我了,但可喜的是,AC了
     1 #pragma warning(disable:4786)
     2 #include<iostream>
     3 #include<string>
     4 #include<cstring>
     5 #include<map>
     6 using namespace std;
     7 map<string,string>m;
     8 map< string , string >::iterator it;
     9 void fuu(char a[])
    10 {
    11 it = m.find(a) ;
    12 
    13           if( it != m.end() )
    14           cout<<it->second;
    15           else cout<<a;
    16 }
    17 void fun(char mm[])
    18 {
    19     char s[10];
    20     int i,nn=0;
    21     int x=strlen(mm);
    22     for(i=0; i<x; i++)
    23     {
    24        if(mm[i]!=' ' &&  mm[i]>='a' && mm[i]<='z')//把所有字符串中的单词转化成单个的单词,然后再map容器中寻找
    25             {
    26                s[nn++]=mm[i];
    27                 if(i==x-2)
    28                 {
    29                 s[nn]='';
    30                    fuu(s);
    31                 cout<<mm[x-1];
    32                  break;
    33                 }
    34              }
    35         else if(mm[i]==' ' || (mm[i]<'a' || mm[i]>'z'))
    36         {
    37                 s[nn]='';
    38                 if(nn>0)
    39                 fuu(s);
    40                 nn=0;
    41                 cout<<mm[i];
    42         }
    43     }
    44     return ;
    45 }
    46 int main()
    47 {
    48 //    freopen("Out.txt","w",stdout);
    49     int len;
    50     char a[11],b[11],mm[3010],ch[11];
    51     cin>>ch;
    52     while(1)
    53     {
    54         cin>>a>>b;
    55         len=strlen(a);
    56       if(len==3 && a[0]=='E' && a[1]=='N' && a[2]=='D')
    57             break;
    58            m[b]=a;
    59     }
    60     int i=0;
    61     while(1)
    62     {
    63         gets(mm);    
    64         len=strlen(mm);
    65         if(len==3 && mm[0]=='E' && mm[1]=='N' && mm[2]=='D')
    66           {
    67                  break;
    68           }
    69         fun(mm);
    70         if(i>0)
    71             cout<<endl;//格式错了调了一个小时啊,最后才在这加了一个
    72         i++;
    73     }
    74     return 0;
    75 }
  • 相关阅读:
    Azure 中 Linux 虚拟机的大小
    排查在 Azure 中创建、重启 Linux VM 或调整其大小时发生的分配故障
    如何在 Azure 中的 Linux 经典虚拟机上设置终结点
    针对通过 SSH 连接到 Azure Linux VM 时发生的失败、错误或被拒绝问题进行故障排除
    Linux 内核超时导致虚拟机无法正常启动
    Java并发编程(十三)同步容器类
    可以开发着玩一下的web项目
    org.tmatesoft.svn.core.SVNCancelException: svn: E200015: authentication canc
    FastDFS单机搭建以及java客户端Demo
    做前端(单纯页面和js)遇到的问题辑录(一)
  • 原文地址:https://www.cnblogs.com/lovychen/p/3232400.html
Copyright © 2011-2022 走看看