n = int(input())
l = 0
r = n
while(l < r):
mid = (l+r+1)//2
cur = (mid*(mid+1))//2
if(cur > n):
r = mid-1
else:
l = mid
if((l*(l+1))//2 != n):
l+=1
print(2*n-l)
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
16 ms |
2796 KB |
Output is correct |
2 |
Correct |
16 ms |
2796 KB |
Output is correct |
3 |
Correct |
17 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 |
17 ms |
2924 KB |
Output is correct |
7 |
Correct |
16 ms |
2924 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 |
17 ms |
2796 KB |
Output is correct |
15 |
Correct |
16 ms |
2796 KB |
Output is correct |
16 |
Correct |
17 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 |
17 ms |
2796 KB |
Output is correct |
20 |
Correct |
18 ms |
2796 KB |
Output is correct |
21 |
Correct |
16 ms |
2796 KB |
Output is correct |
22 |
Correct |
16 ms |
2796 KB |
Output is correct |