hdoj1075-What Are You Talking About 【map】

http://acm.hdu.edu.cn/showproblem.php?pid=1075

What Are You Talking About

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

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('\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.

 

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!

题目大意：给你一些字符串和对应的字符串，然后给出一些话，然后根据之前的字符串来对应输出，如果没有对应，则输出原来的字符串。

代码：

 #include <iostream>
 #include <cstdio>
 #include <cstdlib>
 #include <cstring>
 #include <algorithm>
 #include <string>
 #include <map>
 using namespace std;

 #define MAX 0x7fffffff
 #define N 3000

 map<string,string> m;
 map<string,string>::iterator it;

 int main(){
     //freopen("D:\\input.in","r",stdin);
     //freopen("D:\\output.out","w",stdout);
     char s1[N],s2[N];
     gets(s1);
     while(){
         scanf("%s",s1);
         if(s1[]=='E'){
             break;
         }else{
             scanf("%s",s2);
             m.insert(pair<string,string>(string(s2),string(s1)));
         }
     }
     gets(s1);
     gets(s1);
     while(){
         gets(s1);
         if(s1[]=='E'){
             break;
         }else{
             int len=strlen(s1),step=;
             for(int i=;i<len;i++){
                 if(s1[i]>='a'&&s2[i]<='z'){
                     s2[step++]=s1[i];
                     continue;
                 }else{
                     s2[step]='\0';
                     it=m.find(string(s2));
                     if(it!=m.end()){
                         printf("%s",(*it).second.c_str());
                     }else{
                         printf("%s",s2);
                     }
                     step=;
                     putchar(s1[i]);
                 }
             }
             puts("");
         }
     }
     return ;
 }