zoukankan      html  css  js  c++  java
  • Babelfish (STL)

    题目描述

    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 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 is the message translated to English, one word per line. Foreign words not in the dictionary should be translated as "eh".

    样例输入

    dog ogday
    cat atcay
    pig igpay
    froot ootfray
    loops oopslay
    
    atcay
    ittenkay
    oopslay
    

    样例输出

    cat
    eh
    loops



    代码:
     1 #include <stdio.h>
     2 #include <string.h>
     3 #include <math.h>
     4 #include <algorithm>
     5 #include <iostream>
     6 #include <ctype.h>
     7 #include <iomanip>
     8 #include <queue>
     9 #include <stdlib.h>
    10 #include <sstream>
    11 #include <map>
    12 using namespace std;
    13  
    14 int main()
    15 {
    16     char word[15], fword[15], str[25];
    17     map<string, string> danci;
    18  
    19     while (gets(str) && str[0] != '')
    20     {
    21         sscanf(str, "%s%s", word, fword);
    22         danci[fword] = word;
    23     }
    24  
    25     while (cin >> fword)
    26     {
    27         if (danci.find(fword) != danci.end( ))
    28             cout << danci[fword] << endl;
    29         else
    30             cout << "eh" << endl;
    31     }
    32  
    33     return 0;
    34 }
  • 相关阅读:
    P4329 [COCI2006-2007#1] Bond
    P4802 [CCO 2015]路短最
    1-4-14:计算邮资
    1-4-13:分段函数
    1-4-12:骑车与走路
    1-4-11:晶晶赴约会
    1-4-10:有一门课不及格的学生
    1-4-09:判断能否被3,5,7整除
    1-4-08:判断一个数能否同时被3和5整除
    1-4-07:收集瓶盖赢大奖
  • 原文地址:https://www.cnblogs.com/wangmengmeng/p/5193473.html
Copyright © 2011-2022 走看看