import math
n = int(input())
l = 0
r = 8 * n
while l + 1 < r:
m = (l + r) // 2
if m * (m + 1) // 2 < n:
l = m
else:
r = m
print(2 * n - l - 1)
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
13 ms |
2896 KB |
Output is correct |
2 |
Correct |
14 ms |
2844 KB |
Output is correct |
3 |
Correct |
13 ms |
2896 KB |
Output is correct |
4 |
Correct |
13 ms |
2896 KB |
Output is correct |
5 |
Correct |
13 ms |
2896 KB |
Output is correct |
6 |
Correct |
13 ms |
2936 KB |
Output is correct |
7 |
Correct |
13 ms |
2896 KB |
Output is correct |
8 |
Correct |
12 ms |
2896 KB |
Output is correct |
9 |
Correct |
16 ms |
2872 KB |
Output is correct |
10 |
Correct |
14 ms |
2896 KB |
Output is correct |
11 |
Correct |
18 ms |
2896 KB |
Output is correct |
12 |
Correct |
14 ms |
2896 KB |
Output is correct |
13 |
Correct |
14 ms |
2896 KB |
Output is correct |
14 |
Correct |
14 ms |
2776 KB |
Output is correct |
15 |
Correct |
14 ms |
2896 KB |
Output is correct |
16 |
Correct |
16 ms |
2896 KB |
Output is correct |
17 |
Correct |
14 ms |
2916 KB |
Output is correct |
18 |
Correct |
12 ms |
2896 KB |
Output is correct |
19 |
Correct |
14 ms |
2956 KB |
Output is correct |
20 |
Correct |
14 ms |
2896 KB |
Output is correct |
21 |
Correct |
14 ms |
2896 KB |
Output is correct |
22 |
Correct |
15 ms |
2956 KB |
Output is correct |