hdu 2058 The sum problem(数学题)
2015-05-27 20:49
429 查看
题意:求[1,n]的子区间,使得子区间的元素和为m
![](http://img.blog.csdn.net/20150527204747143?watermark/2/text/aHR0cDovL2Jsb2cuY3Nkbi5uZXQveGt5MTMwNjEwMmNoZW5ob25n/font/5a6L5L2T/fontsize/400/fill/I0JBQkFCMA==/dissolve/70/gravity/Center)
代码:
代码:
#include<cstdio> #include<cstring> #include<cmath> using namespace std; int main() { int n,m; while(scanf("%d%d",&n,&m)&&(n||m)) { for(int j=(int)sqrt(2*m);j>=1;j--) { int i=(2*m/j-j+1)/2; if((i*2-1+j)*j==2*m&&i+j-1<=n) { printf("[%d,%d]\n",i,i+j-1); } } printf("\n"); } return 0; }
相关文章推荐
- HDU 2058 The sum problem Time (等差和推理之类数学题)
- HDU 2058 The sum problem(数学)
- hdu 2058 The sum problem(数学题)
- hdu 2058 The sum problem(数学题)
- hdu - 2058 The sum problem (数学题)
- HDU-2058-The sum problem(数学题技巧型)
- HDU 2058 The sum problem 数学题
- HDU 2058 The sum problem (数学+暴力)
- HDU 2058 The sum problem [数学]
- hdu 2058 The sum problem (数学问题)
- hdu 2058 The sum problem(数学题)
- hdu 2058 The sum problem
- HDOJ 2058 The sum problem(数学问题)
- HDU 2058 The sum problem
- HDU 2058 The Sum Problem
- The sum problem(hdu 2058)解题报告
- HDOJ 2058 The sum problem(数学问题)
- hdoj The sum problem 2058 (数学等差公式&技巧转换)
- HDU 2058 The sum problem(一种神奇的求和思想)
- HDU 2058 The sum problem