def asum(x):
return x*(x+1)//2
def f(i):
return asum(i)
n = int(input())
if n==1:
print(1)
else :
lo = 1
hi = n
while hi-lo>1:
mid = (lo+hi)//2
if f(mid) < n:
lo = mid
else:
hi = mid
i = lo
n -= f(i)
n -= 1 # 0-index
cur = asum(i)+asum(i-1) + 1 + 2*n
print(cur)
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
16 ms |
2924 KB |
Output is correct |
2 |
Correct |
16 ms |
2796 KB |
Output is correct |
3 |
Correct |
16 ms |
2796 KB |
Output is correct |
4 |
Correct |
16 ms |
2796 KB |
Output is correct |
5 |
Correct |
16 ms |
2796 KB |
Output is correct |
6 |
Correct |
16 ms |
2796 KB |
Output is correct |
7 |
Correct |
16 ms |
2796 KB |
Output is correct |
8 |
Correct |
16 ms |
2796 KB |
Output is correct |
9 |
Correct |
16 ms |
2796 KB |
Output is correct |
10 |
Correct |
16 ms |
2796 KB |
Output is correct |
11 |
Correct |
16 ms |
2796 KB |
Output is correct |
12 |
Correct |
16 ms |
2796 KB |
Output is correct |
13 |
Correct |
16 ms |
2796 KB |
Output is correct |
14 |
Correct |
16 ms |
2796 KB |
Output is correct |
15 |
Correct |
16 ms |
2796 KB |
Output is correct |
16 |
Correct |
16 ms |
2796 KB |
Output is correct |
17 |
Correct |
16 ms |
2796 KB |
Output is correct |
18 |
Correct |
16 ms |
2796 KB |
Output is correct |
19 |
Correct |
16 ms |
2796 KB |
Output is correct |
20 |
Correct |
16 ms |
2796 KB |
Output is correct |
21 |
Correct |
16 ms |
2796 KB |
Output is correct |
22 |
Correct |
16 ms |
2796 KB |
Output is correct |