zoukankan      html  css  js  c++  java
  • [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;
    }
    

      

  • 相关阅读:
    网页性能优化,缓存优化、加载时优化、动画优化--摘抄
    display的32种写法--摘抄
    transform与position:fixed的那些恩怨--摘抄
    float 常见用法与问题--摘抄
    10个JavaScript难点--摘抄
    CSS3 动画卡顿性能优化解决方案--摘抄
    CSS 盒模型、解决方案、BFC 原理讲解--摘抄
    web实时长图实践--摘抄
    移动端H5多平台分享实践--摘抄
    canvas绘制视频封面--摘抄
  • 原文地址:https://www.cnblogs.com/KennyRom/p/6250257.html
Copyright © 2011-2022 走看看