Online Judge | Problem Set | Authors | Online Contests | User | ||||||
---|---|---|---|---|---|---|---|---|---|---|

Web Board Home Page F.A.Qs Statistical Charts | Current Contest Past Contests Scheduled Contests Award Contest |

Language: Sequence Sum Possibilities
Description Most positive integers may be written as a sum of a sequence of at least two consecutive positive integers. For instance, 6 = 1 + 2 + 3but 8 cannot be so written.Write a program which will compute how many different ways an input number may be written as a sum of a sequence of at least two consecutive positive integers. Input The first line of input will contain the number of problem instances Output The output for each problem instance will be a single line containing the problem number, a single space and the number of ways the input number can be written as a sequence of consecutive positive integers. Sample Input 7 1 6 2 9 3 8 4 1800 5 987654321 6 987654323 7 987654325 Sample Output 1 1 2 2 3 0 4 8 5 17 6 1 7 23 Source |

[Submit] [Go Back] [Status] [Discuss]

All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di

Any problem, Please Contact Administrator