首页 > 专题系列 > Java解POJ > POJ 2853 Sequence Sum Possibilities [解题报告] Java
2013
11-12

POJ 2853 Sequence Sum Possibilities [解题报告] Java

Sequence Sum Possibilities

问题描述 :

Most positive integers may be written as a sum of a sequence of at least two consecutive positive integers. For instance,

6 = 1 + 2 + 3
9 = 5 + 4 = 2 + 3 + 4

but 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.

输入:

The first line of input will contain the number of problem instances N on a line by itself, (1 N 1000) . This will be followed by N lines, one for each problem instance. Each problem line will have the problem number, a single space and the number to be written as a sequence of consecutive positive integers. The second number will be less than 231 (so will fit in a 32-bit integer).

输出:

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.