【hdu 2058 The sum problem】

The sum problem

Time Limit: 5000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 9020    Accepted Submission(s): 2759

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]

 

Author

8600

 

Source

校庆杯Warm Up

 

Recommend

linle

 

 

 

// Project name : 2058 ( The sum problem ) 
// File name    : main.cpp
// Author       : Izumu
// Date & Time  : Sun Jul 15 14:45:01 2012


#include <iostream>
#include <stdio.h>
#include <string>
#include <cmath>
#include <algorithm>
using namespace std;

int main()
{
    int n, m;
    while (cin >> n >> m && n + m)
    {
        int length = sqrt((double)2 * m) + 2;

        while (length)
        {
            int a = m / length - (length - 1) / 2;
            if ((a + a + length - 1) * length / 2 == m && a > 0 && (a + length - 1) <= n)
            {
                printf("[%d,%d]\n", a, a + length - 1);
            }
            length--;
        }
        cout << endl;
    }
    return 0;
}

// end 
// ism