• [SOJ] Babelfish


    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
     Copy sample input to clipboard
    dog ogday
    cat atcay
    pig igpay
    froot ootfray
    loops oopslay
    
    atcay
    ittenkay
    oopslay
    Sample Output
    cat
    eh
    loops

    #include<stdio.h>  
    #include<string.h>  
    #include<stdlib.h>  
    
    char chip[100001][15];  
    char bhip[100001][15];  
    int  idex[100001];  
    char w[15];  
    int L,yes;  
    
    int cmp(const void *a,const void *b)  //qsort函数要求的比较函数,函数参数列表必须如此
    {  
        return strcmp(bhip[*(int *)a],bhip[*(int *)b]);  //如果a比b大,则返回正数
    }
    
    int main()  
    {
        int i,j,k,t;  
        L=0;  
        
        while(gets(w)&&w[0]!='')  
        {  
            sscanf(w,"%s %s",chip[L],bhip[L]);  
            idex[L]=L;  
            L++;  
        }
    
        qsort(idex,L,sizeof(idex[0]),cmp);//按字典顺序进行快速排序,cmp为排序的方法
    
        while(gets(w))//字典查找方法进行二分查找  
        {  
            i=0;  
            j=L-1;  
            yes=0;  
            while(i<=j)  
            {  
                k=(i+j)/2;  
                t=strcmp(bhip[idex[k]],w);  
                if(t>0)  
                {  
                    j=k-1;  
                }  
                else if(t<0)  
                {  
                    i=k+1;  
                }  
                else  
                {  
                    yes=1;  
                    break;  
                }  
      
            }  
            if(yes==1)  
                printf("%s
    ",chip[idex[k]]);  
            else  
            {  
                printf("eh
    ");
            } 
      
        }  
    
      return 0;
    }
    

      

  • 相关阅读:
    Shell脚本——DHCP自动部署
    Shell脚本——DNS自动部署
    (四)跟我一起玩Linux网络服务:DHCP服务配置之中继代理
    Java-线索二叉树的实现
    Java-堆排序
    Java-二叉树-插入、删除、遍历
    Java-进制转换
    Java--消除重复数字后的最大值
    Java-动态规划-最多苹果数量的方法
    Java-Pi的几种实现
  • 原文地址:https://www.cnblogs.com/KennyRom/p/6250257.html
Copyright © 2020-2023  润新知