The sum problem
来源:互联网 发布:英国做律师 知乎 编辑:程序博客网 时间:2024/06/05 18:23
The sum problem
Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 26048 Accepted Submission(s): 7791
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 1050 300 0
Sample Output
[1,4][10,10][4,8][6,9][9,11][30,30]
Author
8600
Source
校庆杯Warm Up
Recommend
linle | We have carefully selected several similar problems for you: 2059 2056 2062 2060 2049
#include <iostream>#include <cmath>#include <algorithm>#include<cstdio>using namespace std;int N, M;int main(){ //freopen("in.txt","r",stdin); int flag = 0; while(scanf("%d %d", &N, &M) && (M||N)) { int i; int len = int(sqrt(M*2.0)); // ① for(i=len; i>=1; --i) { int temp = M-(i*i+i)/2; // ② if(temp%i == 0) printf("[%d,%d]\n", temp/i+1, temp/i+i); } printf("\n"); } return 0;}
0 0
- HDOJ2058 The sum problem
- HDU2058:The sum problem
- The sum problem
- The sum problem
- 2058 The sum problem
- hdoj2058 The sum problem
- The sum problem 2058
- The sum problem
- The partial sum problem
- The partial sum problem
- hdu2058 The sum problem
- The partial sum problem
- The sum problem
- HDU2058 The Sum Problem
- hdoj2058(the sum problem
- hdoj2058 The sum problem
- hdu2058 The sum problem
- The partial sum problem
- SQLAlchemy复合主键
- Picture
- 【hihocoder】KMP子串数目匹配
- pell数列
- HDU 1253 胜利大逃亡(三维数组+bfs)
- The sum problem
- Yii2表单提交时报错:yii2 Unable to verify your data submission
- 16S rRNA&rDNA测序分析
- 学习笔记:spring配置文件最全约束
- eclipse neon3 安装 gradle插件(改)
- 自己封装一个获取组件的方法
- 海选女主角
- 年龄与疾病(第一种方法)
- 涡轮发动机的推力有多大?