| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 1263808 | proofy | Odd-even (IZhO11_oddeven) | Pypy 3 | 164 ms | 48820 KiB | 
n = int(input())
l = 0
r = 1
def f(x):
  return (x * (x + 1)) // 2
while f(r) <= n:
  r *= 2
while r - l > 1:
  m = (l + r) // 2
  if f(m) <= n:
    l = m
  else:
    r = m
if f(l) == n:
  print(l * l)
else:
  k = n - f(l)
  print(l * l + 2 * k - 1)
Compilation message (stdout)
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
