Coderforces Round #130 DIV. 2
Problem A
分析:水题
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <vector>
#include <iostream>
#include <string>
#include <algorithm>
#include <map>
#include <cmath>
#include <ctime>
#include <set>
using namespace std;
int main()
{
string str, ans;
int len, i, flag;
while (cin >> str)
{
flag = 0;
ans = "";
len = str.length();
if (len < 3) ans = str;
else
{
for (i = 0; i < len-2; i++)
{
if (str[i] == 'W' && str[i+1] == 'U' && str[i+2] == 'B')
{
str[i] = str[i+1] = str[i+2] = '0';
i = i + 2;
}
}
for (i = 0; i < len; i++)
{
if (str[i] != '0')
{
if (flag == 0) flag = 1;
else if (i > 0 && str[i-1] == '0')
ans = ans + ' ';
ans += str[i];
}
}
}
cout << ans << endl;
}
return 0;
}