数学解法

Problem 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]

自己按题目要求一步一步遍历得出，但很遗憾超时了，难受；

#include<iostream>
#include<cstdio>
using namespace std;
int  main()
{
    int n,m,kk,flag;
    while(cin>>n>>m,n&&m){
        int ii=1,k=1;;
        while(ii<m){
            int sum=0,flag=0;
            for(int i=k;i<=n;i++){
                sum+=i;
             if(sum>m) {k++;break;}
             else if(sum==m){kk=k; ii=i;k++;flag=1;break;}
            }
    if(flag==1)
     printf("[%d,%d]\n",kk,ii);
        }
    }
    return 0;
}

这个是参考了网上的代码不考虑子列的终点，而是考虑子列的起点和子列元素的个数，分别记为i，j。由等差数列求和公式，得(i+(i+j-1))j/2==M
，即（2i+j-1）j/2==M（2式），故得i=（2M/j-j+1）/2，将i，j代回2式，成立则[i,i+j-1]满足条件。注意j最小为1，而由2式，得（j+2i）j=2M，而i>=1，故jj<=(int)sqrt(2*M).

#include <iostream>
#include <cmath>
using namespace std;
int main()
{
	int N,M,i,j;
	while(scanf("%d%d",&N,&M) && M+N)
	{ 
	 	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;	
}