zoukankan      html  css  js  c++  java
  • hdu 1075 (map)

    http://acm.hdu.edu.cn/showproblem.php?pid=1075

    What Are You Talking About

    Time Limit: 10000/5000 MS (Java/Others)    Memory Limit: 102400/204800 K (Java/Others)
    Total Submission(s): 13618    Accepted Submission(s): 4366


    Problem Description
    Ignatius is so lucky that he met a Martian yesterday. But he didn't know the language the Martians use. The Martian gives him a history book of Mars and a dictionary when it leaves. Now Ignatius want to translate the history book into English. Can you help him?
     
    Input
    The problem has only one test case, the test case consists of two parts, the dictionary part and the book part. The dictionary part starts with a single line contains a string "START", this string should be ignored, then some lines follow, each line contains two strings, the first one is a word in English, the second one is the corresponding word in Martian's language. A line with a single string "END" indicates the end of the directory part, and this string should be ignored. The book part starts with a single line contains a string "START", this string should be ignored, then an article written in Martian's language. You should translate the article into English with the dictionary. If you find the word in the dictionary you should translate it and write the new word into your translation, if you can't find the word in the dictionary you do not have to translate it, and just copy the old word to your translation. Space(' '), tab(' '), enter(' ') and all the punctuation should not be translated. A line with a single string "END" indicates the end of the book part, and that's also the end of the input. All the words are in the lowercase, and each word will contain at most 10 characters, and each line will contain at most 3000 characters.
     
    Output
    In this problem, you have to output the translation of the history book.
     
    Sample Input
    START
    from fiwo
    hello difh
    mars riwosf
    earth fnnvk
    like fiiwj
    END
    START
    difh, i'm fiwo riwosf.
    i fiiwj fnnvk!
    END
     
    Sample Output
     
    hello, i'm from mars.
    i like earth!
     
    Hint
    Huge input, scanf is recommended.
     
    Author
    Ignatius.L
     
     
    。/。/。/。/。/。/。/。/。/。/。/。/。/。/。/。/。/。。/。/。/。
    虽说是简单的map应用,三但是模拟起来还是很难啊!
    #include <stdio.h>
    #include <string.h>
    #include <stdlib.h>
    #include <iostream>
    #include <map>
    
    using namespace std;
    
    int main()
    {
        char str1[3010],str2[15],str3[15];
        map<string ,string >m;
        map<string ,string >::iterator it;
        scanf("%*s");
        while(scanf("%s",str2)!=EOF&&str2[0]!='E')
        {
            scanf("%s",str3);
            m[str3]=str2;
        }
        scanf("%*s");
        getchar();
        while(cin.getline(str1,3010)&&str1[0]!='E')//遇到换行停止
        {
                 int step=0;
                 memset(str2,'',sizeof(str2));
                 for(int i=0;i<strlen(str1);i++)
                 {
                     if(str1[i]<'a' || str1[i]>'z')
                     {
                           if(step)
                           {
                                 it=m.find(str2);
                                 if(it != m.end())
                                 {
                                     cout<<it->second;
                                 }
                                 else
                                 {
                                     printf("%s",str2);
                                 }
                                 step=0;
                                 memset(str2,'',sizeof(str2));
                           }
                           cout<<str1[i];
                     }
                     else
                     str2[step++]=str1[i];
                 }
                 puts("");
                 //printf("
    ");
        }
        return 0;
    }
  • 相关阅读:
    第二章 存储,2.1 永不停止的脚步——数据库优化之路(作者:佳毅)
    第一章 基础设施,1.3 阿里视频云ApsaraVideo是怎样让4000万人同时狂欢的(作者:蔡华)
    第一章 基础设施,1.2 双11背后基础设施软硬结合实践创新(作者:希有)
    第一章 基础设施,1.1 万亿交易量级下的秒级监控(作者:郁松、章邯、程超、癫行)
    阿里巴巴2016双11背后的技术(不一样的技术创新)
    java实现Haffman编码
    CentOS7安装Nginx并部署
    ubuntu usb权限问题解决
    Camera图像处理原理及实例分析-重要图像概念
    sensor的skipping and binning 模式
  • 原文地址:https://www.cnblogs.com/ccccnzb/p/3890447.html
Copyright © 2011-2022 走看看