Codeforce208A-Dubstep-字符串处理正则表达式

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.

Examples

input

WUBWUBABCWUB

output

ABC

input

WUBWEWUBAREWUBWUBTHEWUBCHAMPIONSWUBMYWUBFRIENDWUB

output

WE ARE THE CHAMPIONS MY FRIEND

Note

In the first sample: “WUBWUBABCWUB” = “WUB” + “WUB” + “ABC” + “WUB”. That means that the song originally consisted of a single word “ABC”, and all words “WUB” were added by Vasya.

In the second sample Vasya added a single word “WUB” between all neighbouring words, in the beginning and in the end, except for words “ARE” and “THE” — between them Vasya added two “WUB”.

题目给出一个字符串，将字符串中的 WUB 给删去，如果两个字母间有 WUB，则这两个字母用空格隔开

正常解法？（CF 好多人用正则表达式（不会 2333）

#include<bits/stdc++.h>
const double E = exp(1);
const int maxn = 1e6 + 10;
using namespace std;
char ch[maxn];
char str[maxn];
int vis[maxn];
int main(int argc, char const *argv[])
{
    cin >> ch;
    int l = strlen(ch);
    int j = 0;
    for (int i = 0; i < l;)
    {if (ch[i] == 'W'&&ch[i + 1] == 'U'&&ch[i + 2] == 'B')
        {vis[j] = 1;
            i += 3;
            continue;
        }
        else
        {str[j++] = ch[i];
            i += 1;
        }
    }
    for (int i = 0; i < j; i++)
    {if (vis[i])
        {if (i)
                cout << " ";
        }
        cout << str[i];

    }
    cout << endl;
    return 0;
}

正则表达式

#include<bits/stdc++.h>//VS 好像无法正常编译
using namespace std;
int main()
{
    string s;
    cin >> s;
    cout << regex_replace(s, regex("WUB"), " ");
}

解析