Submission #1019650

#	Time	Username	Problem	Language	Result	Execution time	Memory
1019650		Minbaev	Odd-even (IZhO11_oddeven)	Pypy 2	0 / 100	22 ms	19272 KiB

oddeven

def binpow(a, b):
  if b == 0:
    return 1
  if b % 2 == 0:
    c = binpow(a, b // 2)
    return (c * c) % mod
  return (binpow(a, b - 1) * a) % mod

def divi(a, b):
  return (a * binpow(b, mod - 2)) % mod

mod = 1e9 + 7

def solve():
  n = int(input())

  l = 1
  r = 1e9
  ans = -1
  while l <= r:
    mid = (l + r) // 2

    sum = mid * (mid + 1) // 2
    if sum >= n:
      ans = mid
      r = mid - 1
    else:
      l = mid + 1

  # Correct calculation for 'val'
  val = (ans * (ans + 1) // 2 - n) * 2 + (ans - 1)

  print(val)

if __name__ == "__main__":
  tt = 1  # Change this to int(input()) for multiple test cases
  while tt:
    solve()
    tt -= 1

• Subtask 1: 0 / 100