STL 之map 杭电1075

      话说这道题我本来是想用来练字典树的，没想到用map竟然也可以做出来，而且代码还这么的简便，，，stl真的很强大啊，，，而且代码对字符串的处理也很精妙，，，是一道好题。。。。。题目：

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!


   
   
   
   

 

ac代码：

#include <iostream>
#include <algorithm>
#include <map>
#include <cstdio>
#include <string>
#include <string.h>
using namespace std;
int main()
{
  string a,b;
  map<string,string> mp;
  cin>>a;
  while(cin>>a&&a!="END")
  {
    cin>>b;
	mp[b]=a;
  }
  cin>>a;
  getchar();
  char ch[3005];
  while(1)
  {
	  gets(ch);
	  int i,len;
    if(strcmp(ch,"END")==0)
		break;
	len=strlen(ch);
	b="";
	for(i=0;i<len;++i)
	{
		if(ch[i]<'a'||ch[i]>'z')
		{
	       if(mp[b]!="")
		     cout<<mp[b];
	       else
		     cout<<b;
	        b="";
	       cout<<ch[i];
		}
		else
			b+=ch[i];
	}
	cout<<endl;
  }
  return 0;
}