2503 Babelfish 二分 字典树 map容器
来源:互联网 发布:golang 1.8.3 编辑:程序博客网 时间:2024/06/08 17:52
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
》》》》》》》》二分法》》》》》》》》》》》》》》
#include <algorithm>#include <cstdlib>#include <cstring>#include <cstdio>using namespace std;struct node{char compare[11];char out[11];}s[110000];int cmp( const void *a, const void *b ){node *x=( node *)a;node *y=( node *)b;return strcmp( x->compare, y->compare );}void search( char *str, int n ){int low=0, high=n, mid, flag;flag=0;while( low<=high ){mid=( low+high )/2;if( strcmp( str, s[mid].compare )==0 ){flag=1;printf( "%s\n",s[mid].out );break;}else if( strcmp( str, s[mid].compare )>0 )low=mid+1;else high=mid-1;}if( flag==0 )printf( "eh\n" );}int main(){char str[110];char a[110],b[110];int n=0;while( gets( str ),str[0] ){sscanf( str,"%s%s",a,b );strcpy( s[n].out, a );strcpy( s[n].compare, b );n++;}qsort( s, n, sizeof( s[0] ), cmp );while( gets( str ) ){search( str, n-1 );}return 0;}
《《《《《《《《《《《字典树》》》》》》》》》》》》》》》》
#include <algorithm>#include <cstring>#include <cstdio>using namespace std;struct node{struct node *son[30];char str[110];};node *root, *now, *next;void build( char *str, char *st ){int i, j;int len=strlen( str );now=root;for( i=0;i<len;i++ ){if( now->son[str[i]-'a']==0 ){next=( struct node * )malloc( sizeof( struct node ) );now->son[str[i]-'a']=next;now=next;for( j=0;j<26;j++ )next->son[j]=0;}else{now=now->son[str[i]-'a'];}}strcpy( now->str, st );}void search( char *str ){int i, len;len=strlen( str );now=root;for( i=0;i<len;i++ ){if( now->son[str[i]-'a']==0 ){printf( "eh\n" );return ;}now=now->son[str[i]-'a'];}printf( "%s\n", now->str );}int main(){int i, j, k, t;char str[110];char a[110],b[110];root=( struct node * )malloc( sizeof( struct node ) );for( i=0;i<26;i++ ) root->son[i]=0;while( gets( str ),str[0] ){sscanf( str,"%s%s",a,b );build( b, a );}while( gets( str ) ){search( str );}return 0;}《《《《map容器《《《《#include <algorithm>#include <iostream>#include <cstring>#include <cstdio>#include <string>#include <map>using namespace std;int main(){ char str[101]; char a[101], b[101]; map<string,string>q; while( gets( str ),str[0] ) { sscanf( str, "%s%s", a, b ); q[b]=a; } while( gets( str ) ) { q.count( str )?cout<<q[str]<<endl:cout<<"eh"<<endl; } return 0;}
0 0
- 2503 Babelfish 二分 字典树 map容器
- POJ 2503 Babelfish 字典树经典题 三种方法 (map,排序+二分,字典树)
- POJ Babelfish 2503(map,字典树)
- POJ 2503 Babelfish(map,字典树,快排+二分,hash)
- Babelfish(字典树 or map)
- poj 2503 Babelfish (map / 二分)
- POJ 2503 Babelfish(STL、二分、字典树、哈希)
- POJ 2503 Babelfish map水过,字典树????
- POJ 2503 Babelfish(人造字典map)
- Babelfish(字典树-map映射功能)
- POJ 2503 Babelfish STL-map容器
- Babelfish(map容器)
- poj 2503 Babelfish(字典树)
- poj 2503 Babelfish 字典树
- poj 2503 Babelfish(字典树)
- POJ 2503 Babelfish(字典树)
- poj-2503-Babelfish-字典树
- poj 2503 Babelfish(字典树)
- <c:if test="${empty(*)}"> 报错javax.el.ELException: Function ':empty' not found;
- Java学习课程(3)
- 黑马程序员-stringbuffer和stringbuilder
- unicode fff0-ffff 是特殊字符
- CRS-0215: Could not start resource 'ora.rac3.LISTENER_RAC3.lsnr'
- 2503 Babelfish 二分 字典树 map容器
- android程序启动时,先显示欢迎界面,再到登录界面
- Windows控制台下输入输出控制
- 数百台Server 批量巡检小插曲
- Lession 1封装与继承
- 【嵌入式Linux】[ARM]:ARM相关小知识
- Fiddler 教程& httpclient调试方法
- 第一次来到,CSDN博客这个大家庭!留个脚印!
- Oracle中SQL语句学习四(DML语句)