HDU 1075 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('\t'), enter('\n') 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!

题目大意:

本题主要是一个翻译工作,输入一句火星文,通过字典查找转换成英文。当输入END是结束输入。

解题思路:

查字典其实就是一个映射的问题,所以在这里我们用映射的map来完成这一题的解答,首先是字典的制作,将字典对应的两个部分通过映射对应起来,然后初入一句话,匹配来完成对应的转换,如果找不到这样的对应,则按原字符输出。

#include<stdio.h> 
#include<string.h>   
#include<iostream>  
#include<map>  

using namespace std;  

map<string,string>zidian;//定义map 
  
int main()  
{  
    string x,y;  //定义字符串 
    cin>>x;  //输入字符串到x 
    while(cin>>x,x!="END")//输入英文 
	{  
		if(x=="START")
		{
			continue;
		}	
        cin>>y;  //向z中输入字符串    火星文 
        zidian[y]=x;  //火星和英文匹配 
    }  
    cin>>x;  
    getchar();  
    char str[3005];  
    while(gets(str)&&strcmp(str,"END")!=0)  
    {  
        int i,len;  
        y="";  
        len=strlen(str);  
        for(i=0;i<len;i++)
		{  
            if(str[i]>='a'&&str[i]<='z')//如果 输入时在a到z之间 
			{  
                 y=y+str[i];// 添加z的字符串 
            }  
            else
			{
				if(zidian[y]=="") //如果在原文中没有翻译 
				{
					cout<<y;//火星文 
				} 
                else 
                {
                	cout<<zidian[y];//如果有翻译则输出 英文 
                }
                y="";  
                cout<<str[i]; //输出 空格或标点符号 
			} 
			  
        }  
        puts("");  
    }  
} 


  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值