ZOJ 1109 Language of FatMouse
2013-01-11 21:13
260 查看
We all know that FatMouse doesn't speak English. But now he has to be prepared since our nation will join WTO soon. Thanks to Turing we have computers to help him.
Input Specification
Input consists of up to 100,005 dictionary entries, followed by a blank line, followed by a message of up to 100,005 words. Each dictionary entry is a line containing an English word, followed by a space and a FatMouse word. No FatMouse word appears more than once in the dictionary. The message is a sequence of words in the language of FatMouse, one word on each line. Each word in the input is a sequence of at most 10 lowercase letters.
Output Specification
Output is the message translated to English, one word per line. FatMouse words not in the dictionary should be translated as "eh".
View Code
Input Specification
Input consists of up to 100,005 dictionary entries, followed by a blank line, followed by a message of up to 100,005 words. Each dictionary entry is a line containing an English word, followed by a space and a FatMouse word. No FatMouse word appears more than once in the dictionary. The message is a sequence of words in the language of FatMouse, one word on each line. Each word in the input is a sequence of at most 10 lowercase letters.
Output Specification
Output is the message translated to English, one word per line. FatMouse words not in the dictionary should be translated as "eh".
Sample Input
dog ogday cat atcay pig igpay froot ootfray loops oopslay atcay ittenkay oopslay
Output for Sample Input
cat eh loops For this problem,I was gaven n times CE.Ok, this is the first problem i did in the ZOJ! I mainly used the map in the STL,but the run time are too long!
View Code
#include<iostream> #include<stdio.h> #include<map> #include<string> #include<cstring> using namespace std; int main() { map<string,string>match; map<string,string>::iterator it; string key,value; char English[15],word[15]; char str[50]; while(gets(str)) { if(strlen(str)==0) break; sscanf(str,"%s%s",English,word); key=word; value=English; match.insert(pair<string,string>(key,value)); } while(cin>>str) { it=match.find(str); if(it!=match.end()) cout<<match[str]<<endl; else cout<<"eh"<<endl; } return 0; }
相关文章推荐
- zoj 1109 Language of FatMouse
- zoj 1109 : Language of FatMouse
- ZOJ 1109 Language of FatMouse (trie树)
- ZOJ 1109 Language of FatMouse
- zoj 1109 zoj 1109 Language of FatMouse(字典树)
- ZOJ1109_Language of FatMouse(STL/map)
- zoj1109-Language of FatMouse 字典树
- zoj 1109 Language of FatMouse
- zoj1109 水题(大神绕道) Language of FatMouse
- zoj 1109 Language of FatMouse(map)
- zoj 1109 Language of FatMouse(字典树)
- ZOJ 1109 Language of FatMouse 【STL】
- ZOJ Problem Set - 1109 Language of FatMouse
- ZOJ 1109 Language of FatMouse
- 字典树例题介绍:ZOJ 1109 Language of FatMouse,HDOJ 1075hdoj What Are You Talking About
- zoj_1109 Language of FatMouse
- ZOJ1109 Language of FatMouse,BST
- UVa 10282 / POJ 2503 Babelfish / ZOJ 1109 Language of FatMouse (STL&map)
- ZOJ 1109 Language of FatMouse
- zoj 1109 Language of FatMouse (字典树Trie)