博客
关于我
强烈建议你试试无所不能的chatGPT,快点击我
<cf>Dubstep
阅读量:7044 次
发布时间:2019-06-28

本文共 2363 字,大约阅读时间需要 7 分钟。

A. Dubstep
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

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
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".

#include 
#include
int main(){ char s[204]; int len; int flag; while(scanf("%s",s)!=EOF) { len=strlen(s); for(int i=0;i
0 && s[i-1]!='0') { printf(" "); i+=2; } } return 0;}

转载地址:http://kuzol.baihongyu.com/

你可能感兴趣的文章
UVA 10169 Urn-ball Probabilities !
查看>>
每日一例,练就编程高手
查看>>
no argument specified with option "/LIBPATH:"错误的解决【转载】
查看>>
初涉c#设计模式-Factory Pattern
查看>>
android 广播复杂参数
查看>>
EmbossMaskFilter BlurMaskFilter
查看>>
android中XML文件解析遇到“not well-formed (invalid token)”解决办法
查看>>
JRuby——Java和Ruby的强强联合
查看>>
ipcs和ipcrm用法简介
查看>>
[Go 笔记]关于 Panic和 Recover
查看>>
关于HP Diagnostics
查看>>
Oracle中的二进制、八进制、十进制、十六进制相互转换函数
查看>>
关于empty函数的输出
查看>>
SCI
查看>>
【菜鸟学习Linux】-第三章- Linux环境搭建-使用VMware9安装Ubuntu 12.04系统
查看>>
分享一组Rpg Marker人物行走,游戏素材图片,共20张图片
查看>>
POJ 1947 Rebuilding Road(树形DP)
查看>>
武汉性能测试研讨会资料共享
查看>>
Masonry+Infinite-Scroll实现无刷新无分页完美瀑布流(转)
查看>>
WPF DataTrigger的两个用法
查看>>