Codeforces #1016A: Death Note 题解

这是一篇关于Codeforces上#1016A题目“Death Note”的题解。文章描述了题目背景,规则是连续n天在一本名为Death Note的笔记本上写名字,每天写ai个名字,每页能容纳m个名字。作者提出了一个策略来遵循规则,并询问每天要翻多少次页。输入包括天数n和每页名字数m,以及每天要写的名字数ai。输出是每天翻页次数ti。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

Description

You received a notebook which is called Death Note. This notebook has infinite number of pages. A rule is written on the last page (huh) of this notebook. It says: “You have to write names in this notebook during n consecutive days. During the i-th day you have to write exactly ai names.”. You got scared (of course you got scared, who wouldn’t get scared if he just receive a notebook which is named Death Note with a some strange rule written in it?).
Of course, you decided to follow this rule. When you calmed down, you came up with a strategy how you will write names in the notebook. You have calculated that each page of the notebook can contain exactly m names. You will start writing names from the first page. You will write names on the current page as long as the limit on the number of names on this page is not exceeded. When the current page is over, you turn the page. Note that you always turn the page when it ends, it doesn’t matter if it is the last day or not. If after some day the current page still can hold at least one name, during the next day you will continue writing the names from the current page.
Now you are interested in the following question: how many times will you turn the page during each day? You are interested in the number of pages you will turn each day from 1 to n.

Input

The first line of the input contains two integers n, m (1≤n≤2e5, 1≤m≤1e9) — the number of days you will write names in the notebook and the number of names which can be written on each page of the notebook.
The second line contains n integers a1,a2,…,an (1≤ai≤1e9), where ai means the number of names you will write in the notebook during the i-th day.

Output

Print exactly n integers t1,t2,…,tn, where ti is the number of times you will turn the page during the i-th day.


简单的模拟题

#include <bits/stdc++.h>
using namespace std;

#define LL long long
#define LB long double
#define ull unsigned long long
#define x first
#define y second
#define pb push_back
#define pf push_front
#define mp make_pair
#define Pair pair<int,int>
#define pLL pair<LL,LL>
#define pii pair<double,double>

const int INF=2e9;
const LL LINF=2e16;
const int magic=348;
const int MOD=998244353;
const double eps=1e-10;
const double pi=acos(-1);

inline int getint()
{
    bool f;char ch;int res;
    while (!isdigit(ch=getchar()) && ch!='-') {}
    if (ch=='-') f=false,res=0; else f=true,res=ch-'0';
    while (isdigit(ch=getchar())) res=res*10+ch-'0';
    return f?res:-res;
}

int n,m;

int main ()
{
    n=getint();m=getint();
    int lft=m,x,ans;
    for (register int i=1;i<=n;i++)
    {
        x=getint();
        if (x<lft) {lft-=x;printf("0 ");continue;}
        ans=1;x-=lft;lft=m;
        ans+=x/m;x%=m;
        lft-=x;
        printf("%d ",ans);
    }
    puts("");
    return 0;
}
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值