HDU - 1075-day9G_hdu 6967-优快云博客

本文链接：https://blog.youkuaiyun.com/weixin_43957652/article/details/86698413

本文介绍了一个有趣的编程问题：使用字典将火星文翻译成英文。通过建立映射关系，实现从火星文到英文的转换，对于未收录词汇，原文保留。此问题考验了数据结构的应用及字符串处理技巧。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

问题来源

问题描述

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?

输入

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.

输出

In this problem, you have to output the translation of the history book.

例子

input

START
from fiwo
hello difh
mars riwosf
earth fnnvk
like fiiwj
END
START
difh, i'm fiwo riwosf.
i fiiwj fnnvk!
END

output

hello, i'm from mars.
i like earth!

解题思路

用map保存字典，然后用输入的火星文去匹配，匹配成功则返回地球文，没有就直接输出。

AC的代码

#include<map>
#include<cctype>
#include<string>
#include<cstdio>
#include<stdio.h>
#include <iostream>
using namespace std;
int main()
{
	map<string, string>mp;
	char aa[12], bb[12], i;
	cin >> aa;
	while (cin>>aa>>bb && strcmp(aa, "END"))
	{
		mp[bb] = aa;
	}
	getchar();
	int k = 0;
	while (i=getchar())
	{
		
		if (isalpha(i))
		{
			aa[k++] = i;
		}
		else
		{
			if (!strcmp(aa, "END"))
				break;
			aa[k] = '\0';
			if (mp.find(aa) != mp.end())
			{
				cout << mp[aa];
			}
			else
			{
				cout << aa;
			}
			memset(aa, 0, sizeof(aa));
			cout<< i;
			k = 0;
		}
	}


}