n = int(input())
l, r, best = 1, 2 * 10 ** 50, -1
while l <= r:
m = (l + r) // 2
if m * (m + 1) // 2 >= n:
best = m
r = m - 1
else:
l = m + 1
print(2 * n - best)
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
10 ms |
2908 KB |
Output is correct |
2 |
Correct |
10 ms |
2908 KB |
Output is correct |
3 |
Correct |
10 ms |
2908 KB |
Output is correct |
4 |
Correct |
10 ms |
2836 KB |
Output is correct |
5 |
Correct |
10 ms |
2848 KB |
Output is correct |
6 |
Correct |
10 ms |
3160 KB |
Output is correct |
7 |
Correct |
10 ms |
2908 KB |
Output is correct |
8 |
Correct |
10 ms |
2712 KB |
Output is correct |
9 |
Correct |
11 ms |
2908 KB |
Output is correct |
10 |
Correct |
10 ms |
2908 KB |
Output is correct |
11 |
Correct |
10 ms |
2908 KB |
Output is correct |
12 |
Correct |
10 ms |
2956 KB |
Output is correct |
13 |
Correct |
10 ms |
2836 KB |
Output is correct |
14 |
Correct |
10 ms |
2908 KB |
Output is correct |
15 |
Correct |
10 ms |
2908 KB |
Output is correct |
16 |
Correct |
10 ms |
2908 KB |
Output is correct |
17 |
Correct |
10 ms |
2908 KB |
Output is correct |
18 |
Correct |
10 ms |
2916 KB |
Output is correct |
19 |
Correct |
10 ms |
2908 KB |
Output is correct |
20 |
Correct |
10 ms |
2908 KB |
Output is correct |
21 |
Correct |
10 ms |
2908 KB |
Output is correct |
22 |
Correct |
13 ms |
3252 KB |
Output is correct |