879A - Borya's Diagnosis - CodeForces Solution


implementation *900

Please click on ads to support us..

Python Code:

x = lambda: map(int,input().split())
n, = x()
cnt = 0; c = 0
for i in range(n):
    a,b = x()
    j = c+1; cnt2 = 0
    while True:
        if(j in range(a,10**20,b)): cnt += (j-c); c = j;break
        if(j%b and cnt2 != 0): cnt2 = 1
        if(cnt2): j += b
        else: j += 1
print(cnt)


Comments

Submit
0 Comments
More Questions

1355A - Sequence with Digits
977B - Two-gram
993A - Two Squares
1659D - Reverse Sort Sum
1659A - Red Versus Blue
1659B - Bit Flipping
1480B - The Great Hero
1519B - The Cake Is a Lie
1659C - Line Empire
515A - Drazil and Date
1084B - Kvass and the Fair Nut
1101A - Minimum Integer
985D - Sand Fortress
1279A - New Year Garland
1279B - Verse For Santa
202A - LLPS
978A - Remove Duplicates
1304A - Two Rabbits
225A - Dice Tower
1660D - Maximum Product Strikes Back
1513A - Array and Peaks
1251B - Binary Palindromes
768B - Code For 1
363B - Fence
991B - Getting an A
246A - Buggy Sorting
884A - Book Reading
1180A - Alex and a Rhombus
445A - DZY Loves Chessboard
1372A - Omkar and Completion