zoukankan      html  css  js  c++  java
  • Codeforces 208A-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的字符即可,且如果有两个WUB及以上WUB也是用一个空格代替。

    #include<bits/stdc++.h>
    using namespace std;
    int main()
    {
        char s[201];
        int a,b,i,j,k;
        cin>>s;
        k = strlen(s);
        a = 0;
        b = 0;
        for(i = 0; i < k; i++){
            if(s[i]=='W'&&s[i+1]=='U'&&s[i+2]=='B'){
                if(b != 0&&a != 1)
                    printf(" ");
                i = i + 2;
                a = 1;  //a用于控制两个及以上WUB时的情况
            }
            else{
                printf("%c",s[i]);
                b = 1;
                a = 0;
            }
        }
        printf("
    ");
        return 0;
    }
    

      

     
  • 相关阅读:
    MySQL 索引优化指南
    Servlet,Tomcat,Jetty,Netty,Mina 对比
    Linux 磁盘IO速度测试
    flume 数据链路问题排查
    MySQL 强行kill后启动失败问题:[ERROR] Plugin 'InnoDB' registration as a STORAGE ENGINE failed.
    hdfs web界面介绍
    python2/python3 编码问题
    Spark WARN Utils: Service 'sparkDriver' could not bind on port 0. Attempting port 1.
    python2 升级到 python3
    万维网的信息检索系统【计算机网络】
  • 原文地址:https://www.cnblogs.com/clb123/p/10375130.html
Copyright © 2011-2022 走看看