杭电 字符串处理 map
来源:互联网 发布:linode 端口被拦截 编辑:程序博客网 时间:2024/05/16 07:56
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.
[/hint]
#include<iostream>#include<algorithm>#include<map>#include<cstdio>#include<string>#include<cstring>using namespace std;int main(){ int i,j; string a,b,c; string m; char n[10000]; cin>>a; map<string ,string >as; while(cin>>b,b!="END") { cin>>c; as[c]=b; } cin>>a; getchar(); while(1) { gets(n); int l=strlen(n); if(strcmp(n,"END")==0) break; m=""; for(i=0;i<l;i++) { if(n[i]<'a'||n[i]>'z') { if(as[m]!="") cout<<as[m]; else cout<<m; m=""; cout<<n[i]; } else m=m+n[i]; } cout<<endl; } return 0;}
- 杭电 字符串处理 map
- 杭电1020 Encoding (字符串处理)
- 杭电HDU 4550 字符串处理
- 杭电2567寻梦(字符串处理)
- 杭电acm 2017字符串统计(字符串处理)
- POJ3297+map字符串处理
- map 杭电 1039
- 杭电1238—搜索入门题目&&字符串处理
- 杭电 1256 画8 (简单的字符串处理)
- 产生冠军 HDU杭电 2094【字符串处理】
- 杭电1860统计字符(字符串处理)
- 杭电acm 1159Common Subsequence(字符串处理+dp)
- 杭电acm 4545魔法串(字符串处理)
- 杭电acm 2549壮志难酬(字符串处理)
- 杭电1004 STL map
- 杭电1003 MAP 排序
- 杭电1251(map)
- 杭电 字符串
- 总结线上遇到的MySQL死锁问题
- java中的线程安全与锁优化
- 用ViewDragHelper自定义侧滑菜单——浅析源码解决与ScrollView的滑动冲突
- Ganglia工具用于监测服务器集群状态
- 对机房服务器的整理记录和总结
- 杭电 字符串处理 map
- 《数据结构之栈篇》--栈的C++实现
- 过滤器实现快速检索资源文件
- java服务器端解决跨域问题【工具包系列】
- http切换至https相关配置
- 使用Fabric部署网站应用
- Solr在Linux中的产品化安装
- JOJ 2453 Candy
- 使用nginx进行ab站点的过程简单分析