首页 > 代码库 > CodeForces Dubstep 题解

CodeForces Dubstep 题解

2024-07-02 09:00:03   228人阅读

Vasya works as a DJ in the best Berland nightclub, and he often uses dubstep music in his performance. Recently, he has decided to take a couple of old songs and make dubstep remixes from them.

Let‘s assume that a song consists of some number of words. To make the dubstep remix of this song, Vasya inserts a certain number of words "WUB" before the first word of the song (the number may be zero), after the last word (the number may be zero), and between words (at least one between any pair of neighbouring words), and then the boy glues together all the words, including "WUB", in one string and plays the song at the club.

For example, a song with words "I AM X" can transform into a dubstep remix as "WUBWUBIWUBAMWUBWUBX" and cannot transform into "WUBWUBIAMWUBX".

Recently, Petya has heard Vasya‘s new dubstep track, but since he isn‘t into modern music, he decided to find out what was the initial song that Vasya remixed. Help Petya restore the original song.

Input

The input consists of a single non-empty string, consisting only of uppercase English letters, the string‘s length doesn‘t exceed 200 characters. It is guaranteed that before Vasya remixed the song, no word contained substring "WUB" in it; Vasya didn‘t change the word order. It is also guaranteed that initially the song had at least one word.

Output

Print the words of the initial song that Vasya used to make a dubsteb remix. Separate the words with a space.

Sample test(s)
input
WUBWUBABCWUB
output
ABC
input
WUBWEWUBAREWUBWUBTHEWUBCHAMPIONSWUBMYWUBFRIENDWUB
output
WE ARE THE CHAMPIONS MY FRIEND

抽掉中间的WUB字符串。这个是用C++总是有点难度的。

本题还算简单的了，只要注意中间插入空格符就好了。

这里虽然是用了二次循环，但是实际时间效率是O(n)

#include <string>
#include <iostream>
using namespace std;

void Dubstep()
{
	string s;
	cin>>s;
	string rs;
	bool wordSpace = false;
	for (unsigned i = 0; i < s.size(); )
	{
		if (s.size() >= 3+i && s.substr(i, 3) == "WUB")
		{
			i += 3;
			wordSpace = true;
		}
		else
		{
			if (rs.size() && wordSpace) rs.push_back(‘ ‘);
			rs.push_back(s[i]);
			for (i++; i < s.size() && s[i] != ‘W‘; i++) rs.push_back(s[i]);
			wordSpace = false;
		}
	}
	cout<<rs;
}


联系
我们