CodeForces 208A/D 18周周赛

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 200characters. 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".

解题报告

学长周赛的时候没有比，不在宿舍就没网参加了，回来看下排名，吊炸天了都，飞飞和家才包了第二第三。。。虽然是小打小闹，但是还是很不错。。。

题目就是说把“WUB”变成空格，输出的时候开头不输出空格。。。

#include<stdio.h>
int main ()
{
    int c=0,i,j;
    char str1[1000],str[1001];
    gets(str1);
    for(i=0,j=0;str1[i]!='\0';i++,j++)
    {
        if(str1[i]=='W'&&str1[i+1]=='U'&&str1[i+2]=='B')
        {
            str[j]=' ';
            i=i+2;
        }
        else str[j]=str1[i];
    }
    str[j]='\0';
    for(i=0;str[i]!='\0';i++)
    {
        if(str[i]!=' ')
        break;
    }
    for(j=i;str[j]!='\0';j++)
    {
        printf("%c",str[j]);
    }
    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, where pi is the number of points Vasya got for the i-th bar. The sequence of points is given in the chronological order. You also know numbers a, 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 integers p1, 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 the cin, 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 exchanges 2 points and gets a mug. Vasya wins abag 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.

解题报告

我就做了比较简单的两题。。。

这题的意思是一个人买巧克力收集包装纸，每张包装纸都有一个数字，代表积分，积分可以换奖品，有五个奖品，每个奖品需要的积分不一样，当然要换越好的奖品了。。。

思路是从最好的奖品来换，换完有剩下积分继续换。。。

#include<stdio.h>
int main ()
{
    int i,j;
    int n;
    __int64 x[100]={0},a[6],b[6]={0,0,0,0,0,0};
    scanf("%I64d",&n);
    for(i=1;i<=n;i++)
        scanf("%I64d",&x[i]);
    for(i=1;i<=5;i++)
        scanf("%I64d",&a[i]);
    for(i=1;i<=n;i++)
    {
        x[i]+=x[i-1];
        for(j=5;j>=1;j--)
        {
            if(x[i]>=a[j])
            {
                b[j]+=x[i]/a[j];
                x[i]%=a[j];
            }
        }
    }
    for(i=1;i<=5;i++)
    {
        printf("%I64d",b[i]);
        if(i!=5)printf(" ");
        else printf("\n");
    }
    printf("%I64d",x[n]);
    return 0;
}