CodeForces 208 A.Dubstep（水~）

Description

给出一个字符串，两个单词之间会用若干个WUB分隔开，输出去掉WUB加好空格的字符串

Input

给出一个只由大写字母组成的字符串，串长不超过200

Output

输出处理后的字符串

Sample Input

WUBWEWUBAREWUBWUBTHEWUBCHAMPIONSWUBMYWUBFRIENDWUB

Sample Output

WE ARE THE CHAMPIONS MY FRIEND

Solution

水题，标记一下第一个单词是否出现来判断每次输出单词前是否需要空格，然后遇到WUB就跳过即可

Code

#include<cstdio>
#include<iostream>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<vector>
#include<queue>
#include<map>
#include<set>
#include<ctime>
using namespace std;
typedef long long ll;
typedef pair<int,int>P;
const int INF=0x3f3f3f3f,maxn=100001;
char s[maxn];
int main()
{
    while(~scanf("%s",s))
    {
        int n=strlen(s);
        int flag=0;
        for(int i=0;i<n;i++)
        {
            while(i+2<n&&s[i]=='W'&&s[i+1]=='U'&&s[i+2]=='B')i+=3;
            if(flag)printf(" ");
            while(i<n&&!(i+2<n&&s[i]=='W'&&s[i+1]=='U'&&s[i+2]=='B'))printf("%c",s[i]),i++;
            i--;
            flag=1;
        }
        printf("\n"); 
    }
    return 0;
}