The sum problem

最新推荐文章于 2021-01-29 14:27:20 发布

wjh-yalta

最新推荐文章于 2021-01-29 14:27:20 发布

阅读量228

点赞数 1

文章标签：题解

本文链接：https://blog.csdn.net/qq_36584689/article/details/89682731

版权

The sum problem

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

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]

题解：

此题目不可暴力，会超时。需运用等差数列求和公式巧妙解题。

确定和 sum=m 的最长的长度，最长则从起点1开始。根据等差求和，公式为：m = len(len+1)*; 根据放缩法则 len^2<2*m, 所以 len 最大等于 sqrt(2*m) ；现在根据长度确定起点 a，根据等差求和公式，
$a = (m - (i - 1) * i / 2) / i = > m = i * a + i * (i - 1) / 2$
开始数字为 a，结尾数字为 a+len-1；

代码：

#include<iostream>
#include<cmath>
using namespace std;

int main()
{
	int n, m;
	while(cin >> n >> m && n||m)
	{
		for(int i=sqrt(2*n); i>=1; i--)
		{
			int a = (m-(i-1)*i/2)/i;
			if(a==0) continue;
			if(m == i*a+i*(i-1)/2)
				cout << "[" << a << "," << a+i-1 << "]\n";
		}
		cout << endl;
	}
	return 0;
}