【杭电100题】校庆杯Warm Up 2058 The sum problem_求和为m的子序列首尾

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.

#include <iostream>
#include <cmath>
#include <stdio.h>

using namespace std;

int main()
{
    int n,m;
    int l,len;
    while(cin>>n>>m&&(n!=0||m!=0)){
        for(len=(int)pow(2*m,0.5);len>=1;len--){
            l=(2*m/len-len+1)/2;
            if((l*2+len-1)*len/2==m)
                printf("[%d,%d]\n",l,l+len-1);
        }
        printf("\n");
    }
    return 0;
}
len>=1;len--){
            l=(2*m/len-len+1)/2;
            if((l*2+len-1)*len/2==m)
                printf("[%d,%d]\n",l,l+len-1);
        }
        printf("\n");
    }
    return 0;
}

【后记】

1.做法：

（1.求出该子序列最大长度，最长时首为1，等差求和得 len=(int)pow(2*m,0.5)

（2.由长度反推子序列的首，等差求和得 l=(2*m/len-len+1)/2

（3.求出首l和长度len，反推子序列和是否等于m

2.自己写了几次都是超时。。。哎