【hd水题】hdoj2058 The sum problem

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]

 

分析：从1开始算的话，提交会超时，所以只能用别的方法。

等差数列前n项和：m=Sn=d/2*n^2+(a1-d/2)*n；

n表示等差数列一个几项，n从最大开始算，没循环一次，n就减小，这样效率就会降低。

利用等差公式得：第一次算，要使n最大，所以，a1=1,d=1;所以，n^2+n-2*m=0;

n=(sqrt(1+8*m)-1)/2;在返回去求出a1:a1=(m/n-n+1)/2;如果，a1是整数，就说

明找到了相应的值，而最后一项自然是a1+n-1；这样不用一个一个加，相比之下还算省时。

 

代码如下：

#include<cstdio> #include<cmath> int main() {__int64 N,m,n; while(scanf("%I64d%I64d",&N,&m),N+m)     {     double a1;      n=(int)((sqrt(8*m+1)-1)/2);     while(n--)     {a1=1.0;     a1=(m*2.0/n-n+1)/2;     if(a1==(int)a1)     printf("[%d,%d]\n",(int)a1,(int)a1+n-1);     }     printf("\n");     } return 0; }