# your code goes here
def sum(n):
return (n * (n + 1) // 2)
n = int(input())
l = 1
r = n
while(l < r):
mid = (l + r) // 2
if(sum(mid) >= n):
r = mid
else:
l = mid + 1
fir = (r * (r - 2)) + 2
pos = n - sum(r - 1)
print(fir + (2 * (pos - 1)))
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
25 ms |
3428 KB |
Output is correct |
2 |
Correct |
25 ms |
3300 KB |
Output is correct |
3 |
Correct |
24 ms |
3300 KB |
Output is correct |
4 |
Correct |
25 ms |
3300 KB |
Output is correct |
5 |
Correct |
27 ms |
3300 KB |
Output is correct |
6 |
Correct |
24 ms |
3300 KB |
Output is correct |
7 |
Correct |
25 ms |
3300 KB |
Output is correct |
8 |
Correct |
24 ms |
3396 KB |
Output is correct |
9 |
Correct |
24 ms |
3300 KB |
Output is correct |
10 |
Correct |
26 ms |
3292 KB |
Output is correct |
11 |
Correct |
25 ms |
3324 KB |
Output is correct |
12 |
Correct |
25 ms |
3300 KB |
Output is correct |
13 |
Correct |
25 ms |
3300 KB |
Output is correct |
14 |
Correct |
24 ms |
3304 KB |
Output is correct |
15 |
Correct |
25 ms |
3300 KB |
Output is correct |
16 |
Correct |
24 ms |
3304 KB |
Output is correct |
17 |
Correct |
25 ms |
3400 KB |
Output is correct |
18 |
Correct |
25 ms |
3300 KB |
Output is correct |
19 |
Correct |
25 ms |
3300 KB |
Output is correct |
20 |
Correct |
26 ms |
3300 KB |
Output is correct |
21 |
Correct |
25 ms |
3300 KB |
Output is correct |
22 |
Correct |
25 ms |
3300 KB |
Output is correct |