zoukankan      html  css  js  c++  java
  • zoj 1109 : Language of FatMouse

    Language of FatMouse

    Time Limit: 10 Seconds      Memory Limit: 32768 KB

    We all know that FatMouse doesn't speak English. But now he has to be prepared since our nation will join WTO soon. Thanks to Turing we have computers to help him.

    Input Specification

    Input consists of up to 100,005 dictionary entries, followed by a blank line, followed by a message of up to 100,005 words. Each dictionary entry is a line containing an English word, followed by a space and a FatMouse word. No FatMouse word appears more than once in the dictionary. The message is a sequence of words in the language of FatMouse, one word on each line. Each word in the input is a sequence of at most 10 lowercase letters.

    Output Specification

    Output is the message translated to English, one word per line. FatMouse 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
    

    Output for Sample Input

    cat
    eh
    loops
    

    Source: Zhejiang University Training Contest 2001

    算法:

    Map,思想是调用map,定义map<string,string> M

    代码:

    #include <iostream>
    #include <map>
    #include <cstdio>
    #include <string>
    #include <cstring>
    using namespace std;
    map<string,string> M;
    int main()
    {
        char a[12],b[12],str[30];
        while(gets(str))
        {
            if(strcmp(str,"")==0)break;
            int i,l=strlen(str);
            for(i=0;i<l;++i)
            {
                if(str[i]==' ')break;
            }
            strncpy(a,str,i);
            a[i]='';
            strncpy(b,str+i+1,l-i);
            b[l-i]='';
           // cout<<a<<endl<<b<<endl;
            M[b]=a;
        }
    
        while(cin>>b)
        {
            if(M[b]=="")
            {
                cout<<"eh"<<endl;
            }
            else
            {
                cout<<M[b]<<endl;
            }
        }
        return 0;
    }
    


     

  • 相关阅读:
    LintCode 27. 拓扑排序 DFS实现
    LintCode 155. 二叉树的最小深度
    LintCode 90. k数和 II
    LintCode 33. N皇后问题
    Oracle分组后取某列最大值的行数据
    Oracle日期范围
    Mongo可视化工具基本操作
    修改winform安装包写日志文件权限
    Winform安装包出现无法访问网络位置
    ComboBox的真实值和显示值
  • 原文地址:https://www.cnblogs.com/james1207/p/3265233.html
Copyright © 2011-2022 走看看