| 시간 제한 | 메모리 제한 | 제출 | 정답 | 맞힌 사람 | 정답 비율 |
|---|---|---|---|---|---|
| 1 초 (추가 시간 없음) | 512 MB (추가 메모리 없음) | 117 | 88 | 76 | 81.720% |
Peter was walking down the street, and noticed that the street had houses numbered sequentially from m to n. While standing at a particular house x, he also noticed that the sum of the house numbers behind him (numbered from m to x − 1) equaled the sum of the house numbers in front of him (numbered from x + 1 to n).
Given m, and assuming there are at least three houses total, find the lowest n such that this is possible.
Input consists of a single line containing the integer m (1 ≤ m ≤ 1,000,000).
On a single line, print m, x, and n, in order, separated by spaces.
It is guaranteed that there will be a solution with n less than or equal to 10,000,000.
1
1 6 8
11
11 49 68
999999
999999 1317141 1571535
999000
999000 1000000 1000999