zoukankan      html  css  js  c++  java
  • qsort/bsearch的应用

    问题描述:

    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

    大意描述:

                   模拟一本双语辞典的功能,用户输入一种语言,通过字典翻译成另外一种语言

    参考资料:

    http://www.slyar.com/blog/poj-2503-c.html

    问题解决:

    dict1

    dict2

    dict4

    dict5

    dict6

    dict7

    注:   

             程序,主要是使用了排序和二分查找,进行字典排序和字典查找

    源文件:

    dictionary.cpp

  • 相关阅读:
    04_Windows平台Spark开发环境构建
    Hadoop Streaming 使用及参数设置
    Kafka 及 PyKafka 的使用
    Database Subquery
    Miscellaneous
    Emacs
    算法归纳
    逆元求组合数
    Elasticsearch 原理
    Linux的内存分页管理【转】
  • 原文地址:https://www.cnblogs.com/luosongchao/p/3239520.html
Copyright © 2011-2022 走看看