The sum problem(难以理解)
题目描述:
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,2,3,......N,你所要做的就是算出和为M的所有连续的数列。
通过答案:
#include <stdio.h>
#include<math.h>
int main() {
int n,m,len,a;
while (scanf("%d %d", &n,&m)!=EOF&&m+n!=0) {
for(len=sqrt(2*m);len>=1;len--){ //len表示项数
a=(2*m/len-len+1)/2; //计算首项
if((2*a+len-1)*len/2==m){ //求和
printf("[%d,%d]\n",a,a+len-1);
}
}
printf("\n"); //空行
}
return 0;
}