zoukankan      html  css  js  c++  java
  • POJ 2503 Babelfish

    Babelfish
    Time Limit: 3000MS   Memory Limit: 65536K
    Total Submissions: 32169   Accepted: 13832

    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 ogday
    cat atcay
    pig igpay
    froot ootfray
    loops oopslay
    
    atcay
    ittenkay
    oopslay
    

    Sample Output

    cat
    eh
    loops
    

    Hint

    Huge input and output,scanf and printf are recommended.

    Source

     
     
    方法很多
    快排加二分
    hash表
    还有这个模板Trie
     1 #include <stdio.h>
     2 #include <cstring>
     3 
     4 struct Tire
     5 {
     6     int next[26];//儿子节点
     7     char eng[11];//单词
     8 }tt[200005];
     9 
    10 char en[11],fr[11];
    11 int tp = 0;//定义在main函数外会默认为0
    12 
    13 void insert(char *x,int site)
    14 {
    15     if(*x!='
    ')//如果不到结尾
    16     {
    17         if(tt[site].next[*x-'a']==0)//增加子节点
    18         {
    19             tt[site].next[*x-'a'] = ++tp;
    20         }
    21         insert(x+1,tt[site].next[*x-'a']);//继续
    22     }else//抵达结尾
    23     {
    24         strcpy(tt[site].eng,en);
    25     }
    26 }
    27 
    28 void search(char *x,int site)
    29 {
    30     if(*x!='')
    31     {
    32         if(tt[site].next[*x-'a']==0)//找不到!!!
    33         {
    34             printf("eh
    ");
    35             return;
    36         }
    37         search(x+1,tt[site].next[*x-'a']);//继续
    38     }else//找到了
    39     {
    40         printf("%s
    ",tt[site].eng);
    41     }
    42 }
    43 
    44 int main()
    45 {
    46     char str[100];
    47     while(gets(str)&&str[0])//从stdin流中读取字符串,直至接受到换行符或EOF时停止,
    48     //并将读取的结果存放在buffer指针所指向的字符数组中。
    49     //换行符不作为读取串的内容,读取的换行符被转换为‘’空字符,并由此来结束字符串。
    50     {
    51         sscanf(str,"%s%s",en,fr);// 从一个字符串中读进与指定格式相符的数据。
    52         insert(fr,0);
    53     }
    54     while(scanf("%s",fr) != EOF){
    55         search(fr,0);
    56     }
    57     return 0;
    58 }
  • 相关阅读:
    JDK 动态代理分析
    java class 文件解析
    ARM体系结构和汇编指令
    待整理
    Nand Flash,Nor Flash,CFI Flash,SPI Flash 之间的关系
    CPU与内存的那些事
    关于DMA和它的仇家
    BSS段 data段 text段 堆heap 和 栈stack
    关于常用序号的几点说明(数字序号顺序)
    word表格自动编号,前面加章节号
  • 原文地址:https://www.cnblogs.com/Run-dream/p/3891195.html
Copyright © 2011-2022 走看看