Submission #1607823

---

Source Code Expand

from collections import defaultdict, Counter
from itertools import product, groupby, count, permutations, combinations
from math import pi, sqrt
from collections import deque
from bisect import bisect, bisect_left, bisect_right
INF = float("inf")


def ceil(a, b):
    return (a + b - 1) // b


def main():
    N = int(input())
    a_list, b_list = [], []
    for _ in range(N):
        A, B = map(int, input().split())
        a_list.append(A)
        b_list.append(B)

    now = 0
    for a, b in zip(a_list[::-1], b_list[::-1]):
        a += now
        d = (b * ceil(a, b)) - a
        now += d

    print(now)


if __name__ == '__main__':
    main()

Submission Info

Judge Result