HDU 1075 (2020.3.19训练G题)(map,getline的使用)

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.

题意:给你一些字符串的映射,以START开始,END结束,再给出一些长串,也是START到END,要求输出经过已知映射后的长串

我们定义一个map,记录题给的映射,然后对每个长串挨个位置读取,是字母就放入ans的string里,是空格就立刻判断map里是否存在该映射,有就立刻输出,否则输出原串(记得将ans置空)

#include<iostream>
#include<string>
#include<map>
#include <cctype>
using namespace std;
typedef long long ll;
const ll maxn = 3005;
string s, sec, dex;
map<string, string>p;
string ans = "";
int main()
{
	cin >> s;
	while (cin >> sec)
	{
		if(sec == "END")
			break;
		cin >> dex;
		p[dex] = sec;
	}
	
	string s1;
	cin >> s;
	getline(cin, s);//去掉换行符
	while (getline(cin, s1))
	{
		if (s1 == "END")
			break;
		int len = s1.size();
		for (int i = 0; i < len; i++)
		{
			if (isalpha(s1[i]))
			{
				ans += s1[i];
				if (!isalpha(s1[i + 1]))
				{
					if (p[ans] != "")
					{
						cout << p[ans];
					}
					else
					{
						cout << ans;
					}
					ans.clear();
				}
			}
			else
				cout << s1[i];
				
			
		}
		cout << endl;
	}
}

  • 0
    点赞
  • 1
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值