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 contains multiple test cases. each case contains two integers N, M( 1 <= N, M <= 1000000000).input ends with N = M = 0.
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,4]
[10,10]
[4,8]
[6,9]
[9,11]
[30,30]
linle | We have carefully selected several similar problems for you:
2059 2062 2060 2072 2061
#include<stdio.h>
#include<math.h>
int main()
{
int n,m;
while(scanf("%d%d",&n,&m)!=EOF)
{
if(n==0&&m==0)
break;
for(int i=sqrt(2*m);i>=1;i--)
{
int na1=m- (i*(i-1)/2);
if( na1%i == 0 )
printf("[%d,%d]\n",na1/i,na1/i+i-1);
}
printf("\n");
}
}
