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): 20835    Accepted Submission(s): 6140

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   |   We have carefully selected several similar problems for you:  2059 2056 2057 2062 2060 

数学知识等差数列的应用，刚开始做时是直接从1~n,一一进行相加列举，结果超时了，后来才知道是等差数列的应用

sum=(a+a+d)*d/2

#include<stdio.h>
#include<math.h>
int main()
{
 int N,M,i,n,m;
 while(scanf("%d%d",&N,&M),N||M)
 {
  n=sqrt((double)(M)*2);
  while(n)
  {
   m=M/n-(n-1)/2;
   if(m*n+(n*(n-1)/2)==M)
    printf("[%d,%d]\n",m,m+n-1);
   n--;
  }
  printf("\n");
 }
 return 0;
}