POJ 2503 Babelfish
来源:互联网 发布:大数据阅读答案 编辑:程序博客网 时间:2024/06/05 20:13
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 atcaypig igpayfroot ootfrayloops oopslayatcayittenkayoopslay
Sample Output
catehloops
分析:字符串哈希。用map也可水过。
Code1(hash):
#include <algorithm>#include <iostream>#include <cstring>#include <string>#include <cstdio>#include <vector>#include <queue>#include <cmath>#include <map>#include <set>#define eps 1e-7#define LL long long#define pb push_back#define lson l,m,rt<<1#define rson m+1,r,rt<<1|1#define Max(a,b) ((a)>(b)?(a):(b))#define Min(a,b) ((a)<(b)?(a):(b))using namespace std;const int MOD=100007;struct node{ char s1[15],s2[15]; int next;}pos[MOD];int head[MOD];char str1[15],str2[15];int GetKey(int len){ int ans=0; for(int i=0;i<len;i++){ ans=(ans*26+(str2[i]-'a'))%MOD; } return ans;}int main(){ int cnt=0; memset(head,-1,sizeof(head)); while(str1[0]=getchar()){ if(str1[0]=='\n') break; scanf("%s %s",&str1[1],str2); int tmp=GetKey(strlen(str2)); strcpy(pos[cnt].s1,str1); strcpy(pos[cnt].s2,str2); pos[cnt].next=head[tmp]; head[tmp]=cnt++; getchar(); } while(scanf("%s",str2)!=EOF){ int tmp=GetKey(strlen(str2)); bool flag=false; for(int i=head[tmp];i!=-1;i=pos[i].next){ if(strcmp(str2,pos[i].s2)==0){ flag=true; printf("%s\n",pos[i].s1); break; } } if(!flag) printf("eh\n"); } return 0;}
Code2(map):
#include<iostream>#include<cstdio>#include<string>#include<cstring>#include<map>using namespace std;char s1[15],s2[15];int main(){ map<string,string>data; map<string,bool>mark; while(1){s1[0]=getchar(); if(s1[0]=='\n')break; scanf("%s",s1+1); scanf("%s",s2); mark[s2]=true; data[s2]=s1; getchar();}while(cin>>s1){if(mark[s1])printf("%s\n",data[s1].c_str());else printf("eh\n");}return 0;}
- poj 2503 Babelfish
- POJ 2503 Babelfish(HASH)
- poj 2503 Babelfish
- POJ 2503 Babelfish
- POJ 2503 Babelfish
- poj 2503 Babelfish
- POJ 2503 Babelfish
- poj 2503 Babelfish 【hash】
- poj 2503 Babelfish【trie】
- POJ 2503 Babelfish
- poj-2503 Babelfish
- poj-2503 Babelfish
- poj 2503 Babelfish
- poj 2503 Babelfish
- POJ 2503 Babelfish
- POJ 2503 Babelfish (Hash)
- POJ 2503 Babelfish
- poj 2503 Babelfish(二分)
- Android之Fragment(官网资料翻译)
- <<黑马程序员>>java基础之正则表达式
- JAVA解析XML的四种方式
- double 保留小数点后两位数
- C语言零星笔记--(const、typedef)
- POJ 2503 Babelfish
- HTTP 返回状态值详解
- URL编码和解码
- Android回调机制
- Python的functools模块
- UITableViewCell的选中时的颜色及tableViewCell的selecte与deselecte
- 基本数据结构之线性表-链表
- HashSet的使用
- POJ_2142_The Balance(模线性方程)