hdu2058（数学题，有点坑）

最新推荐文章于 2020-02-04 20:48:17 发布

Hugo5332

最新推荐文章于 2020-02-04 20:48:17 发布

阅读量2.2k

点赞数 1

分类专栏： ACM ACM算法

本文链接：https://blog.csdn.net/xxxslinyue/article/details/55667587

版权

ACM 同时被 2 个专栏收录

105 篇文章 0 订阅

订阅专栏

ACM算法

99 篇文章 2 订阅

订阅专栏

The sum problem

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

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

等差数列求和公式，但是一直超时。。。因为没有剪枝，其实sqrt（m*2)就够了，我一直是从m开始虽然没错但就是超时，数学题还是要多练啊！

#include <iostream> 
#include <cmath>
#include <iomanip>
#include <string>
using namespace std;
int main(void)
{
	int n,m;
	while(cin>>n>>m && n||m)
	{
		for(int i=sqrt(2*m);i>=1;i--)
		{
			int a=(m-((i-1)*i)/2)/i;
			if(m==a*i+(i*(i-1))/2&&a>0)
			cout<<'['<<a<<','<<a+i-1<<']'<<endl;
		}
		cout<<endl;
	}
	return 0;
}