hdu 2058 The sum problem
2015-05-07 19:30
316 查看
[code]#include<stdio.h> int main() { int i,m,x,y,n,ans,num; while(~scanf("%d%d",&n,&m)&&n&&m) { ans=0; for(i=1; i<n; i++) { ans+=i; y=i; if(ans>=m) break; } if(ans==m) num=i; else num=i-1; for(i=num; i>0; i--) { x=(2*m/i-(i-1))/2; y=(2*m/i+(i-1))/2; if((x+y)*(y-x+1)==2*m) printf("[%d,%d]\n",x,y); } printf("\n"); } return 0; }
相关文章推荐
- 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
- 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
- The sum problem hdu 2058
- HDU 2058 The sum problem(数学)
- HDU 2058 The sum problem Time (等差和推理之类数学题)