|
||||||||||
Consecutive sumTime Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1832 Accepted Submission(s): 867 Problem Description Every body knew that 15 = 1+2+3+4+5 = 4+5+6 = 7+8. Now give you a number N, tell me how many ways to represent N as a sum of consecutive positive integers. For example, 15 have 3 ways to be found. Input Each line will contain an signed 32-bits integer N. Process to end of file. Output For each case, output the answer in one line. Sample Input
Sample Output
Author Wiskey Source | ||||||||||
|