Preparing NOJ

# The sum problem

1000ms 32768K

## Description:

Given a sequence 1,2,3,......N, your job is to calculate all the possible sub-sequences that the sum of the sub-sequence is M.

## Input:

Input contains multiple test cases. each case contains two integers N, M( 1 <= N, M <= 1000000000).input ends with N = M = 0.

## Output:

For each test case, print all the possible sub-sequence that its sum is M.The format is show in the sample below.print a blank line after each test case.

## Sample Input:

20 10
50 30
0 0

## Sample Output:

[1,4]
[10,10]

[4,8]
[6,9]
[9,11]
[30,30]

Info

Provider HDU

Origin 校庆杯Warm Up

Code HDU2058

Tags

Submitted 4

Passed 2

AC Rate 50%

Date 06/03/2019 16:25:32

Related

Nothing Yet