hdu 2058 The sum problem

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]

---

 问题链接：http://acm.hdu.edu.cn/showproblem.php?pid=2058

问题分析：

根据等差数列来算,数列长度 

• 直接暴力肯定会超时的。。。。。。
• 等差数列 求和公式
• 
• 
• 

源代码

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




int main()
{
    long long N, M;
    while(scanf("%lld%lld", &N, &M) != EOF)
    {
        if(N == 0 && M == 0)
            break;
        long long na;
        for(long long n = sqrt(2*M); n > 0; n--)
        {
            na = M- n*(n-1)/2;
            if(na % n == 0)
                printf("[%lld,%lld]\n", na/n, na/n+n-1);
        }
        printf("\n");        //格式 print a blank line after each test case.
    }

    return 0;
}