1995A - Diagonals - CodeForces Solution


2-sat binary search bitmasks brute force chinese remainder theorem combinatorics constructive algorithms data structures expression parsing fft flows greedy implementation math meet-in-the-middle string suffix structures ternary search trees

Please click on ads to support us..

Python Code:

gg=int(input())

for r in range(0,gg):
  n, k = input().split()
  n = int(n)
  k = int(k)
  s = 0
  t = 0
  if k > 0:
    t += n
    s += 1
    n -= 1
    if t != k and k> n:
        while 2*n + t < k and n> 0:
          t += 2*n
          s += 2
          n -= 1

        if n + t < k:
            t += 2*n
            s += 2
            n -= 1
        else:
            t += n
            s += 1
            n -= 1

    print(s)
  else:
    print(s)


Comments

Submit
0 Comments
More Questions

1615B - And It's Non-Zero
1619E - MEX and Increments
34B - Sale
1436A - Reorder
1363C - Game On Leaves
1373C - Pluses and Minuses
1173B - Nauuo and Chess
318B - Strings of Power
1625A - Ancient Civilization
864A - Fair Game
1663B - Mike's Sequence
448A - Rewards
1622A - Construct a Rectangle
1620A - Equal or Not Equal
1517A - Sum of 2050
620A - Professor GukiZ's Robot
1342A - Road To Zero
1520A - Do Not Be Distracted
352A - Jeff and Digits
1327A - Sum of Odd Integers
1276A - As Simple as One and Two
812C - Sagheer and Nubian Market
272A - Dima and Friends
1352C - K-th Not Divisible by n
545C - Woodcutters
1528B - Kavi on Pairing Duty
339B - Xenia and Ringroad
189A - Cut Ribbon
1182A - Filling Shapes
82A - Double Cola