|시간 제한||메모리 제한||제출||정답||맞은 사람||정답 비율|
|1 초||64 MB||116||59||44||51.765%|
Output all the ways in which a given positive integer N can be obtained as the sum of several (two or more) consecutive positive integers. -The author apologizes if reading the task took too long, and promises that, in the future, he will try to be more concise, i.e., that he will try to explain the task using as less words and apologies in the footnotes as possible-
The first line of input contains the positive integer N (3 ≤ N ≤ 1010).
For each sum of consecutive positive integers that is equal to N, in one line output the first and the last addend. The order of lines in the output is not important. In each test case, at least one corresponding sum will exist.
13 14 8 10 2 7
10 = 1 + 2 + 3 + 4.