HDOJ2058 转变搜索策略

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.
如果从1到100000000进行搜索，次数太多，必然超时。因此转变策略。
由等差数列求和公式(i+i+l-1)l/2=m （其中i为子列第一个数，l为子列项数）可得i=(2m-l*l+l)/2l，即对已知的m和l，i是唯一值。
又由公式得l<=sqrt(2m)。则只要搜索所有l，找到合适的i即可。

#include <iostream>
#include<cstdio>
#include<string>
#include <iomanip>
#include<algorithm>
#include<cmath>
using namespace std;

int main()
{
    int n, m,i,j,l;
    while (cin >> n >> m)
    {
        if (n == 0 && m == 0)
            break;
        for(l=(int)sqrt(2*m);l>=1;l--)
        {
            i = (2 * m - l * l + l) / l/2;
            if ((i + i + l - 1) * l / 2 == m)
                cout << '[' << i << ',' << l+i-1 << ']' << endl;
        }
        cout << endl;
    }
    return 0;
}