HDU1258Sum It Up
来源:互联网 发布:线切割3b手动编程入门 编辑:程序博客网 时间:2024/05/22 19:29
Sum It Up
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4866 Accepted Submission(s): 2548
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
深度优先搜索:
#include <cstdio>#include <iostream>#include <cstring>#include <algorithm>using namespace std;int key,n,cnt;int a[20],b[20];int cmp(int a,int b){ return a>b;}void dfs(int x,int sum,int posa,int posb){ if(sum>key) return; if(sum==key) { cnt++; for(int i=0;i<posb;i++) { if(i) printf("+%d",b[i]); else printf("%d",b[i]); } puts(""); } for(int i=posa;i<n;i++) { b[posb]=a[i]; dfs(a[i],sum+a[i],i+1,posb+1); while(a[i]==a[i+1]&&i+1<n)//搜索完毕后,若下一个搜索的数仍与当前相同,则跳过直至不相同 i++; }}int main(){ while(~scanf("%d%d",&key,&n),n+key) { for(int i=0;i<n;i++) { scanf("%d",&a[i]); } sort(a,a+n,cmp); printf("Sums of %d:\n",key); cnt=0; dfs(0,0,0,0); if(!cnt) printf("NONE\n"); } return 0;}
0 0
- HDU1258Sum It Up
- 搜索专题: HDU1258Sum It Up
- POJ1564Sum It Up
- JOJ1197: Sum It Up
- Sum It Up
- Sum It Up
- Poj Sum It Up
- poj_1564Sum 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
- java多线程01
- python学习心得实例(3)
- JAVA 面向对象第四天
- Oracle中rownum的用法
- Spring的核心机制依赖注入简介
- HDU1258Sum It Up
- Two Sum
- 软件工程 软件工程师的誓言
- 【POJ 1094】Sorting It All Out
- 基于SSH验证框架的validation.xml验证不执行
- 黑马程序员——Java基础--IO流(二)
- 总结
- Java程序日志三
- C语言结构体及函数传递数组参数示例