ACM--火星文--HDOJ 1075--What Are You Talking About--map
2016-07-19 23:36
381 查看
HDOJ 题目地址:传送门
Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 102400/204800 K (Java/Others)
Total Submission(s): 19987 Accepted Submission(s): 6590
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!
Hint
Huge input, scanf is recommended.
What Are You Talking About
Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 102400/204800 K (Java/Others)Total Submission(s): 19987 Accepted Submission(s): 6590
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!
Hint
Huge input, scanf is recommended.
#include<iostream> #include<stdio.h> #include<string.h> #include<map> using namespace std; map<string,string> m; int main(){ string start,temp; cin>>start; while(cin>>start&&start!="END"){ cin>>temp; m[temp]=start; } cin>>start; getchar(); string a=""; while(getline(cin,start)&&start!="END"){ int index=0; for(int i=0;i<start.size();i++){ if(islower(start[i])){ a+=start[i]; }else{ if(m.find(a)!=m.end()){ cout<<m[a]; }else{ cout<<a; } a=""; printf("%c",start[i]); } } cout<<endl; } }
相关文章推荐
- maven的安装
- PHP+ExtJS 文件上传示例
- ArcGIS Engine 项目10.1升级10.2
- 继承例外
- 常用命令2
- python初级项目课(二)
- 【NGUI】ui tween 和 play tween
- Object类
- 破解WebStorm
- PHP中的正则
- 修改内核参数
- 无向图中的tarjan 算法及其割点、割边
- C学习笔记(十)字符串 自己实现字符串函数
- 错误与异常
- iOS9 UniversalLink使用
- 云服务器 ECS Linux IO 占用高问题排查方法
- iOS学习-资料来源
- 方法控制流程
- 【一天一道LeetCode】#299. Bulls and Cows
- 创建动态链接库,使用自己的dll中的排序算法,用Qt将排序用时在界面上用表格的形式呈现出来