POJ 2503 Babelfish(人造字典map)
来源:互联网 发布:淘宝ralph lauren 编辑:程序博客网 时间:2024/04/28 18:18
Babelfish
Time Limit: 3000MS Memory Limit: 65536KTotal Submissions: 40424 Accepted: 17216
Description
You have just moved from Waterloo to a big city. The people here speak an incomprehensible dialect of a foreign language. Fortunately, you have a dictionary to help you understand them.
Input
Input consists of up to 100,000 dictionary entries, followed by a blank line, followed by a message of up to 100,000 words. Each dictionary entry is a line containing an English word, followed by a space and a foreign language word. No foreign word appears more than once in the dictionary. The message is a sequence of words in the foreign language, one word on each line. Each word in the input is a sequence of at most 10 lowercase letters.
Output
Output is the message translated to English, one word per line. Foreign words not in the dictionary should be translated as "eh".
Sample Input
dog ogdaycat atcayfroot ootfraypig igpayatcayloops oopslayittenkayoopslay
Sample Output
catehloops
Hint
Huge input and output,scanf and printf are recommended.
你刚刚从滑铁卢搬到一个大城市。这里的人们讲一门外语的一个难以理解的方言。幸运的是,你有一个字典帮助你了解他们。
输入包含字典条目多达100000,紧随其后的是一个空行,紧随其后的是一个消息的100000字。每一个字典条目包含一个英语单词是一条直线,紧随其后的是一个空间和一门外语单词。没有外国单词不止一次出现在字典里
用map对应键值,但因为不会对应字符串类键值,所以较麻烦
#include<stdio.h>#include<map>#include<string.h>#include<algorithm>#include<iostream>using namespace std;char h[100001][20];int main(){char a[20],b[20],c[20];int k=1;int p=0;map<string,int>l;//定义容器for(int i=0;;i++){for(int i=0;;i++){scanf("%c",&a[i]);if(a[i]==' '){a[i]='\0';break;}if(a[i]=='\n'){p=1;break;}}if(p==1)break;scanf("%s",b);getchar(); l[b]=k; strcpy(h[k++],a); }while(~scanf("%s",c)){if(l[c]==0)printf("eh\n");elseprintf("%s\n",h[l[c]]);}}
0 0
- POJ 2503 Babelfish(人造字典map)
- POJ Babelfish 2503(map,字典树)
- POJ 2503 Babelfish(map)
- POJ 2503 Babelfish map水过,字典树????
- POJ 2503 Babelfish ,map
- Babelfish - POJ 2503 map
- POJ 2503-Babelfish(map)
- poj 2503 Babelfish (map)
- poj 2503 Babelfish (map)
- POJ 2503 Babelfish(字典树水题)
- POJ 2503 Babelfish(字典树)
- poj 2503 Babelfish(字典树)
- POJ - 2503 - Babelfish(字典树)
- POJ 2503:Babelfish(字典树入门)
- POJ 2503 Babelfish(map,字典树,快排+二分,hash)
- poj 2503 Babelfish (map,trie 树)
- poj 2503 Babelfish(STL map写法)
- POJ-2503 Babelfish(map模板题)
- 安装screenfetch
- C语言的Socket编程例子(TCP和UDP)
- APP导航实现
- 如何去掉ListView/GridView等列表控件滑到顶部或底部时的模糊边缘效果
- 【Android】使RecyclerView 支持setEmptyView
- POJ 2503 Babelfish(人造字典map)
- bsearch()函数(二分查找)
- C#针对SQLserver数据库获取数据
- Magic Powder - 2
- 【POJ】2299 - Ultra-QuickSort(离散化 & (树状数组 | 线段树))
- Java的I/O流
- POSIX线程
- dubbo相关知识(三)--socket长连接和短连接
- uestc 250 Windy数 数位dp