Codeforces Round #130 (Div. 2)

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

 

挺水的一道题,开始的时候因为空格的问题纠结了一会,搞得20分钟才出。大神们都是4、5分钟出的。

#include<cstring>
#include<iostream>
#include<cstdio>

using namespace std;

char str[205];

int main()
{
    int i,len;

    while(scanf("%s",str)!=EOF)
    {
        len=strlen(str);
        i=0;
        while(i<len)
        {
            if(str[i]=='W'&&str[i+1]=='U'&&str[i+2]=='B')
                 i=i+3;
            else
            {
                printf("%c",str[i]);
                if(str[i+1]=='W'&&str[i+2]=='U'&&str[i+3]=='B')
                    printf(" ");
                i++;
            }

        }
        printf("\n");
    }
    return 0;
}

D. Prizes, Prizes, more Prizes
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

Vasya, like many others, likes to participate in a variety of sweepstakes and lotteries. Now he collects wrappings from a famous chocolate bar "Jupiter". According to the sweepstake rules, each wrapping has an integer written on it — the number of points that the participant adds to his score as he buys the bar. After a participant earns a certain number of points, he can come to the prize distribution center and exchange the points for prizes. When somebody takes a prize, the prize's cost is simply subtracted from the number of his points.

Vasya didn't only bought the bars, he also kept a record of how many points each wrapping cost. Also, he remembers that he always stucks to the greedy strategy — as soon as he could take at least one prize, he went to the prize distribution centre and exchanged the points for prizes. Moreover, if he could choose between multiple prizes, he chose the most expensive one. If after an exchange Vasya had enough points left to get at least one more prize, then he continued to exchange points.

The sweepstake has the following prizes (the prizes are sorted by increasing of their cost):

  • a mug (costs a points),
  • a towel (costs b points),
  • a bag (costs c points),
  • a bicycle (costs d points),
  • a car (costs e points).

Now Vasya wants to recollect what prizes he has received. You know sequence p1, p2, ..., pn, wherepi is the number of points Vasya got for thei-th bar. The sequence of points is given in the chronological order. You also know numbersa, b,c, d,e. Your task is to find, how many prizes Vasya received, what prizes they are and how many points he's got left after all operations are completed.

Input

The first line contains a single integer n (1 ≤ n ≤ 50) — the number of chocolate bar wrappings that brought points to Vasya. The second line contains space-separated integersp1, p2, ..., pn (1 ≤ pi ≤ 109). The third line contains 5 integers a, b, c, d, e (1 ≤ a < b < c < d < e ≤ 109) — the prizes' costs.

Output

Print on the first line 5 integers, separated by a space — the number of mugs, towels, bags, bicycles and cars that Vasya has got, respectively. On the second line print a single integer — the number of points Vasya will have left after all operations of exchange are completed.

Please, do not use the %lld specifier to read or write 64-bit integers in С++. It is preferred to use thecin, cout streams or the%I64d specifier.

Sample test(s)
Input
3
3 10 4
2 4 10 15 20
Output
1 1 1 0 0 
1
Input
4
10 4 39 2
3 5 10 11 12
Output
3 0 1 0 3 
0
Note

In the first sample Vasya gets 3 points after eating the first chocolate bar. Then he exchanges2 points and gets a mug. Vasya wins a bag after eating the second chocolate bar. Then he wins a towel after eating the third chocolate bar. After all chocolate bars 3 - 2 + 10 - 10 + 4 - 4 = 1 points remains.


贪心题,把一个c误输入成了d,导致纠结了很久。郁闷。


 

#include<iostream>
#include<stdio.h>

using namespace std;

__int64 num[55];
__int64 a,b,c,d,e,a1,b1,c1,d1,e1,a0,b0,c0,d0,e0,sum;

int main()
{
    int i,T;
    while(scanf("%d",&T)!=EOF)
    {
        for(i=1;i<=T;i++)
           scanf("%I64d",&num[i]);
        scanf("%I64d%I64d%I64d%I64d%I64d",&a,&b,&c,&d,&e);
        sum=num[1];a0=b0=c0=d0=e0=0;
        i=1;
        while(i<=T)
        {
            while(1)
            {
            if(sum>=e)
            {
                 e1=sum/e;
                 e0+=e1;
                 sum=sum-e*e1;
            }
            if(e>sum&&sum>=d)
            {
                d1=sum/d;
                d0+=d1;
                sum=sum-d*d1;
            }
            if(d>sum&&sum>=c)
            {
                c1=sum/c;
                c0+=c1;
                sum=sum-c*c1;
            }
            if(c>sum&&sum>=b)
            {
                b1=sum/b;
                b0+=b1;
                sum=sum-b1*b;
            }
            if(b>sum&&sum>=a)
            {
                a1=sum/a;
                a0+=a1;
                sum=sum-a1*a;
            }
            if(sum<a)
                break;
            }
        i++;
        sum+=num[i];
        }
        printf("%I64d %I64d %I64d %I64d %I64d\n",a0,b0,c0,d0,e0);
        printf("%I64d\n",sum);
    }
    return 0;
}


 

能力有限,只yy出了两道题,C题那道并查集的题目,没看懂题目要求输出什么。剩下的两题是在不愿意看了。希望下次加油吧。
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值