Death Note (Codeforces 1016A)
Tags: Implement, greedy

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 $$$a_i$$$ 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 \le n \le 2 \cdot 10^5$$$, $$$1 \le m \le 10^9$$$) — 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 $$$a_1, a_2, \dots, a_n$$$ ($$$1 \le a_i \le 10^9$$$), where $$$a_i$$$ means the number of names you will write in the notebook during the $$$i$$$-th day.

Output: Print exactly $$$n$$$ integers $$$t_1, t_2, \dots, t_n$$$, where $$$t_i$$$ is the number of times you will turn the page during the $$$i$$$-th day.

Note: In the first example pages of the Death Note will look like this $$$[1, 1, 1, 2, 2], [2, 2, 2, 2, 2], [3, 3, 3, 3, 3], [3, 3, 3, 3]$$$. Each number of the array describes during which day name on the corresponding position will be written. It is easy to see that you should turn the first and the second page during the second day and the third page during the third day.

Sample Inputs:
3 5
3 7 9

4 20
10 9 19 2

1 100
99

Sample Outputs:
0 2 1

0 0 1 1

0

Solution (Python):
from sys import stdin

def main():
    (n, m) = [int(x) for x in stdin.readline().split()]
    a = [int(x) for x in stdin.readline().split()]
    total = a[0]
    lista = []
    for i in range(n - 1):
        if total < m:
            lista.append(0)
            total = total + a[i + 1]
        else:
            lista.append(total // m)
            total = total % m + a[i + 1]
    if total < m:
        lista.append(0)
    else:
        lista.append(total // m)
        total = total % m
    resp = ' '.join([str(x) for x in lista])
    print(resp)
main()

Solution (Python):
from sys import stdin

def main():
    (n, m) = [int(x) for x in stdin.readline().split()]
    a = [int(x) for x in stdin.readline().split()]
    l = []
    total = a[0]
    for i in range(n - 1):
        if total < m:
            l.append(0)
            total = total + a[i + 1]
        else:
            l.append(total // m)
            total = total % m + a[i + 1]
    if total < m:
        l.append(0)
    else:
        l.append(total // m)
        total = total % m
    resp = ' '.join([str(x) for x in l])
    print(resp)
main()

Solution (Python):
import heapq

def main():
    (n, m) = [int(i) for i in input().split()]
    pages = [int(i) for i in input().split()]
    prevCount = 0
    res = []
    for pg in pages:
        currCount = pg + prevCount
        res.append(str(currCount // m))
        prevCount = currCount % m
    print(' '.join(res))
    return
if __name__ == '__main__':
    main()