zoukankan      html  css  js  c++  java
  • hdu1075 What Are You Talking About

    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!
    这题用map可以做,学到了map的一个函数find.
    #include<iostream> #include<stdio.h> #include<string.h> #include<string> #include<algorithm> using namespace std; #include<map> char s1[100],s2[100],s[100],str[5000],str1[100]; int main() { int len,i,j,t; scanf("%s",s); map<string,string> hash; map<string,string>::iterator it; hash.clear(); while(scanf("%s",s1)!=EOF) { if(strcmp(s1,"END")==0)break; scanf("%s",s2); hash[s2]=s1; } scanf("%s",s); getchar(); while(gets(str)) { if(strcmp(str,"END")==0)break; len=strlen(str); t=0; for(i=0;i<len;i++){ if(str[i]>='a' && str[i]<='z'){ str1[t]=str[i];t++; } else{ str1[t]='';t=0; it=hash.find(str1); if(it!=hash.end()){ cout<<it->second; } else{ printf("%s",str1); } printf("%c",str[i]); } } printf(" "); } return 0; }
  • 相关阅读:
    JavaScript词法结构
    【python】类变量、实例变量
    把pandas dataframe转为list方法
    list 删除一个元素的三种做法--python
    Web.config中rewite 节点引起的500.19错误
    extjs让按钮可用或者不可用
    VS2010启动奔溃
    迟来的年终总结
    Nginx配置多个server
    RestSharp的简单用法
  • 原文地址:https://www.cnblogs.com/herumw/p/9464810.html
Copyright © 2011-2022 走看看