code forces Educational Codeforces Round 21

最新推荐文章于 2021-05-25 00:03:18 发布

ACM_e

最新推荐文章于 2021-05-25 00:03:18 发布

阅读量398

点赞数

分类专栏： codeforces

本文链接：https://blog.csdn.net/ACM_e/article/details/72234906

版权

codeforces 专栏收录该内容

16 篇文章 0 订阅

订阅专栏

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.

Note

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

//大概题意就是找只有一个数字的年份（不包括0）比如1-10都是 20 30 100 1000 30000.。。。

找到相邻的就可以 ac代码

#include<iostream>
#include<string.h>
#include<stdio.h>
using namespace std;
char a[1000001];
int main(){
   int j,k;
   long long a1=0,b1;
      cin>>a;
   k=strlen(a);
   for(j=0;j<strlen(a);j++){
      a1=(a[j]-'0')+a1*10;
   }
   b1=a[0]-'0'+1;
   for(j=0;j<strlen(a)-1;j++){
       b1=b1*10;
   }
   cout<<b1-a1<<endl;
   return 0;

}

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 $\text{[math]}$ .

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.

// 题意求平均睡眠时间

5 3

1 2 3 4 5

123

234

345 这样相加之后除n-k+1

好坑爹刚开始没有想到前缀和 tle 很长时间最后忘记用longlong 又错了

ac 代码第一次前缀和==

#include<bits/stdc++.h>
using namespace std;
#define  maxn 2000000+20
long long  a[maxn],b[maxn]={0};
int main(){
   int n,k,j,i=0,l=1;
   long long t;
     scanf("%d %d",&n,&k);
   double sum,s=0;
   for(j=0;j<n;j++){
      scanf("%d",&a[j]);
      t+=a[j];
      b[j+1]=t;
   }
   for(j=0;j<n;j++){
       if(k+j<=n)
         s+=b[k+j]-b[j];
   }

   sum=s/(n-k+1);
   printf("%.10lf\n",sum);

   return 0;
}

下面是学长的要过来学习一下

#include <iostream>
#include <cstdio>
long long a[200005];
int main()
{
    int n,k,t=1;
    std::cin>>n>>k;
    a[0]=0;
    for(int i=1;i<=n;i++)
    {
        scanf("%d",&a[i]);
        a[i]+=a[i-1];
    }
    double v=0;
    for(int i=1;i<=n-k+1;i++)
    {
        v+=a[i+k-1]-a[i-1];
    }
    v/=(double)(n-k+1);
    printf("%.10lf\n",v);
}





人生第一场cf 以后加油 喜欢上这种感觉！  虽然才写了两道题但是很高兴！