• <cf>Dubstep


    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 <stdio.h>
    #include <string.h>
    int main()
    {
        char s[204];
        int len;
        int flag;
        while(scanf("%s",s)!=EOF)
        {
            len=strlen(s);
            for(int i=0;i<len;i++)
            {
                if(s[i]=='W' && s[i+1]=='U' && s[i+2]=='B')
                {
                    s[i]=s[i+1]=s[i+2]='0';
                    i+=2;
                }
                else flag=i;
            }
            for(int i=0;i<len;i++)
                if(s[i]!='0')
                {
                    if(i!=flag)
                    {
                        printf("%c",s[i]);
                    }
                    else
                    {
                        printf("%c\n",s[i]);
                        break;
                    }
                }
                else if(i>0 && s[i-1]!='0')
                {
                    printf(" ");
                    i+=2;
                }
        }
        return 0;
    }
    


  • 相关阅读:
    (基础篇)正则表达式的语法汇总与详细介绍
    (基础篇) 正则表达式详解
    (基础篇)PHP字符串操作
    (基础篇)PHP流程控制语句
    CentOS 7.0 安装配置 kafka 消息队列
    配置 Gitblit 进行 Git 代码管理
    nexus 中央仓库
    svn + jenkins + maven 实现java环境的自动化构建和部署
    Mariadb galera 群集
    Jboss 集群配置
  • 原文地址:https://www.cnblogs.com/cszlg/p/2910498.html
Copyright © 2020-2023  润新知