HDOJ 2058 The sum problem(数学问题)

原创 2012年03月23日 15:32:21

The sum problem

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


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]
 


我本来的想法是考虑子列的起点和终点,分别以s和e表示,由等差数列求和公式有(s+e)*(e-s+1)/2==M(1式),化为e*(e+1)-s*(s-1)==2*M, so , e=(int)sqrt(2*M+s*(s-1)),将得到的e再代回1式,成立则[s,e]满足条件。

但是,2*M+s*(s-1)太大……

后来参考网上的一个算法,不考虑子列的终点,而是考虑子列的起点和子列元素的个数,分别记为i,j。由等差数列求和公式,得(i+(i+j-1))*j/2==M ,即(2*i+j-1)*j/2==M(2式),故得i=(2*M/j-j+1)/2,将i,j代回2式,成立则[i,i+j-1]满足条件。注意j最小为1,而由2式,得(j+2*i)*j=2*M,而i>=1,故j*j<=(int)sqrt(2*M).

AC code:

#include <iostream>
#include <cmath>
using namespace std;
int main()
{
	int N,M,i,j;
	while(scanf("%d%d",&N,&M) && M+N)
	{ 
	 	for(j=pow(2.0*M,0.5);j>0;j--)
		{
			i=(2*M/j-j+1)/2;
			if(j*(j+2*i-1)/2==M) printf("[%d,%d]\n",i,i+j-1);
		}
		printf("\n");					  
 	} 	
	return 0;	
}


相关文章推荐

HDOJ-2058(The sum problem)(找规律)(数学)

HDOJ-2058(The sum problem)(找规律)(数学) Problem Description Given a sequence 1,2,3,......N, your job is...
  • hpulw
  • hpulw
  • 2016年03月03日 21:43
  • 274

杭电ACM 2058 The sum problem

http://acm.hdu.edu.cn/showproblem.php?pid=2058 穷举,但不能从老老实实从一开始一个一个的穷举,一定要利用好公式,否则会时间超出限制 i是开头,j是...

(Java实现) HDOJ 2058 The sum problem 高斯求和

Problem Description Given a sequence 1,2,3,......N, your job is to calculate all the possible sub-s...

hdu 2058 The sum problem(数学题)

题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=2058 Time Limit: 5000/1000 MS (Java/Others)    Mem...

HDU 2058 The sum problem

Problem Description Given a sequence 1,2,3,......N, your job is to calculate all the possible sub-s...

HDU2058The sum problem

The sum problem Time Limit: 5000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)...
  • xu_fish
  • xu_fish
  • 2016年01月11日 17:12
  • 188

杭电2058-The sum problem

The sum problem Time Limit: 5000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)...

HDOJ sum problem 问题

Sum ProblemTime Limit: 1000/500 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total...
  • HAIGLI
  • HAIGLI
  • 2015年10月02日 00:26
  • 145

hdoj1032 The 3n + 1 problem (数学模拟)

题目:http://acm.hdu.edu.cn/showproblem.php?pid=1032 题意: 1          print   n 2      if   n==1 , end 3 ...

hdoj Jam's math problem 5615 (数学十字相乘法)暴力

Jam's math problem Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Othe...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:HDOJ 2058 The sum problem(数学问题)
举报原因:
原因补充:

(最多只允许输入30个字)