Y - The sum problem

Y - The sum problem

题目描述

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]

---

思路：

循环遍历以1~n为首项，m为数列和，1为公差的数列；

---

代码

#include <stdio.h>
#include <math.h>
int main()
{
    int i,j;
    int N,M;

    while(scanf("%d%d",&N,&M),N||M)
    {
        for(j=pow(2.0*M,0.5);j>0;j--)
        {
            i=(2*M/j-j+1)/2;
            if(j*(j+2*i-1)/2==M) printf("[%d,%d]\n",i,i+j-1);
        }
        printf("\n");
    }
    return 0;
}