import math
x = int(input())
l = 1
r = x #int(math.sqrt(x))+3
while (l < r):
m = (l + r)//2
if((m*(m+1)//2) > x):
r = m-1
elif(((m+1)*(m+2)//2) < x):
l = m+1
else:
break
ans = (l + r)//2
need = x - ans*(ans+1)//2
if(need == 0):
aa = ans * ans
else :
aa = ans * ans+1 +((need-1)*2)
print(aa)
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
16 ms |
2796 KB |
Output is correct |
2 |
Correct |
16 ms |
2796 KB |
Output is correct |
3 |
Correct |
16 ms |
2796 KB |
Output is correct |
4 |
Correct |
18 ms |
2796 KB |
Output is correct |
5 |
Correct |
18 ms |
2796 KB |
Output is correct |
6 |
Correct |
17 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 |
17 ms |
2796 KB |
Output is correct |
12 |
Correct |
16 ms |
2796 KB |
Output is correct |
13 |
Correct |
17 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 |
17 ms |
2924 KB |
Output is correct |
18 |
Correct |
16 ms |
2796 KB |
Output is correct |
19 |
Correct |
17 ms |
2816 KB |
Output is correct |
20 |
Correct |
16 ms |
2796 KB |
Output is correct |
21 |
Correct |
17 ms |
2796 KB |
Output is correct |
22 |
Correct |
19 ms |
2972 KB |
Output is correct |