CF Educational Codeforces Round 21

A. Lucky Year

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Apart from having lots of holidays throughout the year, residents of Berland also have whole lucky years. Year is considered lucky if it has no more than 1 non-zero digit in its number. So years 100, 40000, 5 are lucky and 12, 3001 and 12345 are not.

You are given current year in Berland. Your task is to find how long will residents of Berland wait till the next lucky year.

Input

The first line contains integer number n (1 ≤ n ≤ 109) — current year in Berland.

Output

Output amount of years from the current year to the next lucky one.

Examples

input

4

output

1

input

201

output

99

input

4000

output

1000

Note

In the first example next lucky year is 5. In the second one — 300. In the third — 5000.

读英语啦，刚背完英语的我真是脑壳痛，其实就是”no more than 1 non-zero digit in its number“这点东西的意思，不超过1位不是0，找到比他大的，减一下就好。

#include <bits/stdc++.h>
using namespace std;
int main() {
    ios::sync_with_stdio(false);
    cin.tie();
    int n;
    cin>>n;
    int t=,m=log10(n);
    while(m--){
        t=t*;
    }
    for(int i=;i<=;i++){
        if(t*i>n){
            cout<<t*i-n<<endl;
            break;
        }
    }
    return ;
}

本来使用用个循环处理的位数，用了log10真是清爽了许多。这个循环应该也可以省的直接cout<<(n/t+1)*t-n<<endl;

B. Average Sleep Time

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

It's been almost a week since Polycarp couldn't get rid of insomnia. And as you may already know, one week in Berland lasts k days!

When Polycarp went to a doctor with his problem, the doctor asked him about his sleeping schedule (more specifically, the average amount of hours of sleep per week). Luckily, Polycarp kept records of sleep times for the last n days. So now he has a sequence a1, a2, ..., an, where ai is the sleep time on the i-th day.

The number of records is so large that Polycarp is unable to calculate the average value by himself. Thus he is asking you to help him with the calculations. To get the average Polycarp is going to consider k consecutive days as a week. So there will be n - k + 1 weeks to take into consideration. For example, if k = 2, n = 3 and a = [3, 4, 7], then the result is .

You should write a program which will calculate average sleep times of Polycarp over all weeks.

Input

The first line contains two integer numbers n and k (1 ≤ k ≤ n ≤ 2·105).

The second line contains n integer numbers a1, a2, ..., an (1 ≤ ai ≤ 105).

Output

Output average sleeping time over all weeks.

The answer is considered to be correct if its absolute or relative error does not exceed 10 - 6. In particular, it is enough to output real number with at least 6 digits after the decimal point.

Examples

input

3 2
3 4 7

output

9.0000000000

input

1 1
10

output

10.0000000000

input

8 2
1 2 4 100000 123 456 789 1

output

28964.2857142857

Note

In the third example there are n - k + 1 = 7 weeks, so the answer is sums of all weeks divided by 7.

K个连续子序列的和，用前缀和很简单啊，求贡献的话省时间也省空间

#include <bits/stdc++.h>
using namespace std;
int main() {
    ios::sync_with_stdio(false);
    cin.tie();
    int n,k;
    cin>>n>>k;
    long long s=;
    int p=n-k+;
    int t=min(p,k);
    for(int i=;i<n;i++){
        long long q;
        cin>>q;
        s+=min(min(i+,n-i),t)*q;
    }
    printf("%.10f",(double)s/(double)p);
    return ;
}

C. Tea Party

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Polycarp invited all his friends to the tea party to celebrate the holiday. He has n cups, one for each of his n friends, with volumes a1, a2, ..., an. His teapot stores w milliliters of tea (w ≤ a1 + a2 + ... + an). Polycarp wants to pour tea in cups in such a way that:

• Every cup will contain tea for at least half of its volume
• Every cup will contain integer number of milliliters of tea
• All the tea from the teapot will be poured into cups
• All friends will be satisfied.

Friend with cup i won't be satisfied, if there exists such cup j that cup i contains less tea than cup j but ai > aj.

For each cup output how many milliliters of tea should be poured in it. If it's impossible to pour all the tea and satisfy all conditions then output -1.

Input

The first line contains two integer numbers n and w (1 ≤ n ≤ 100, ).

The second line contains n numbers a1, a2, ..., an (1 ≤ ai ≤ 100).

Output

Output how many milliliters of tea every cup should contain. If there are multiple answers, print any of them.

If it's impossible to pour all the tea and satisfy all conditions then output -1.

Examples

input

2 10
8 7

output

6 4 

input

4 4
1 1 1 1

output

1 1 1 1 

input

3 10
9 8 10

output

-1

Note

In the third example you should pour to the first cup at least 5 milliliters, to the second one at least 4, to the third one at least 5. It sums up to 14, which is greater than 10 milliliters available.

C题是贪心啊，特判的

#include <bits/stdc++.h>
using namespace std;
int a[],b[],c[];
bool cmp(int x,int y)
{return a[x]>a[y];}
int main() {
    ios::sync_with_stdio(false);
    cin.tie();
    int n,w,i;
    cin>>n>>w;
    for(i=;i<=n;++i){
    cin>>a[i];
    w-=b[i]=a[i]+>>;
    c[i]=i;}
    if(w<){
    puts("-1");
    return ;}
    sort(c+,c+n+,cmp);
    while(w)
    for(i=;w&&i<=n;++i)
    if(b[c[i]]<a[c[i]])++b[c[i]],--w;
    for(i=;i<=n;++i)
    printf("%d ",b[i]);
    return ;
}