Sum It Up
来源:互联网 发布:zepto.js左右滑动事件 编辑:程序博客网 时间:2024/06/05 14:07
Sum It Up
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6720 Accepted Submission(s): 3535
Problem Description
Given a specified total t and a list of n integers, find all distinct sums using numbers from the list that add up to t. For example, if t=4, n=6, and the list is [4,3,2,2,1,1], then there are four different sums that equal 4: 4,3+1,2+2, and 2+1+1.(A number can be used within a sum as many times as it appears in the list, and a single number counts as a sum.) Your job is to solve this problem in general.
Input
The input will contain one or more test cases, one per line. Each test case contains t, the total, followed by n, the number of integers in the list, followed by n integers x1,...,xn. If n=0 it signals the end of the input; otherwise, t will be a positive integer less than 1000, n will be an integer between 1 and 12(inclusive), and x1,...,xn will be positive integers less than 100. All numbers will be separated by exactly one space. The numbers in each list appear in nonincreasing order, and there may be repetitions.
Output
For each test case, first output a line containing 'Sums of', the total, and a colon. Then output each sum, one per line; if there are no sums, output the line 'NONE'. The numbers within each sum must appear in nonincreasing order. A number may be repeated in the sum as many times as it was repeated in the original list. The sums themselves must be sorted in decreasing order based on the numbers appearing in the sum. In other words, the sums must be sorted by their first number; sums with the same first number must be sorted by their second number; sums with the same first two numbers must be sorted by their third number; and so on. Within each test case, all sums must be distince; the same sum connot appear twice.
Sample Input
4 6 4 3 2 2 1 15 3 2 1 1400 12 50 50 50 50 50 50 25 25 25 25 25 250 0
Sample Output
Sums of 4:43+12+22+1+1Sums of 5:NONESums of 400:50+50+50+50+50+50+25+25+25+2550+50+50+50+50+25+25+25+25+25+25
题意和思路解释的很清晰:http://blog.csdn.net/pengwill97/article/details/54933373
#include<string.h>#include<stdio.h>#include<algorithm>using namespace std;int sum,n;int a[15];int vis[15];int b[15];int flag;void output(int depth){for(int i=0;i<depth;i++){if(!i)printf("%d",b[i]);else printf("+%d",b[i]);}printf("\n");}void dfs(int depth,int toal,int pos){if(sum==toal){flag=1;output(depth);return ;}if(toal>sum)return ;if(pos>=n)return ;b[depth]=a[pos];dfs(depth+1,toal+a[pos],pos+1);while(pos+1<n&&a[pos]==a[pos+1]) pos++;dfs(depth,toal,pos+1);}int main(){while(scanf("%d%d",&sum,&n)){if(sum==0 &&n==0)break;flag=0;for(int i=0;i<n;i++)scanf("%d",&a[i]);memset(b,0,sizeof(b));printf("Sums of %d:\n",sum);dfs(0,0,0);if(flag==0)printf("NONE\n");}}
阅读全文
0 0
- JOJ1197: Sum It Up
- Sum It Up
- Sum It Up
- Poj Sum It Up
- Sum It Up
- HDU1258 Sum It Up
- HDU1258:Sum It Up
- Sum It Up
- poj sum it up
- poj sum it up
- Sum It Up
- Sum It Up
- poj1564 Sum it up
- Sum It Up
- Sum it up
- zoj1711-Sum It Up
- Sum It Up hdu1258
- Sum It Up
- 并发容器
- linux的nohup命令的用法
- vue组件库开发-环境搭建-npm上传
- STL_map
- [日常训练] 藏宝路径
- Sum It Up
- ajax将前台的Map类型数据传到Servlet并解析的方法。
- python基于openCV3的人脸识别
- 收集安卓开发干货
- 排序算法汇总
- 最全的常用正则表达式大全——包括校验数字、字符、一些特殊的需求等等
- Macbook Pro上运行windows to go
- Tomcat中文乱码
- LeetCode 152. Maximum Product Subarray