hdoj1258
来源:互联网 发布:网络施工进度计划表 编辑:程序博客网 时间:2024/05/24 06:42
Sum It Up
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1838 Accepted Submission(s): 920
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
Source
浙江工业大学第四届大学生程序设计竞赛
Recommend
JGShining
#include<iostream>#include<cstring>using namespace std;int number[13];int ans[13];int t;int n;int len;int flag;void dfs(int start, int sum) { if (sum == t) { flag = 1; for (int i = 0; i < len - 1; i++) cout << ans[i] << '+'; cout << ans[len - 1] << endl; return; } for (int i = start; i < n; i++) { int tmp = sum + number[i]; if (tmp > t) continue; if (i > start && number[i] == number[i - 1]) continue; ans[len++] = number[i]; dfs(i + 1, tmp); len--; }}int main(void) { while (cin >> t >> n, n) { len = 0; flag = 0; for (int i = 0; i < n; i++) cin >> number[i]; cout << "Sums of " << t << ':' << endl; dfs(0, 0); if (!flag) cout << "NONE" << endl; } return 0;}
- hdoj1258
- hdoj1258
- HDOJ1258 又是一道深搜入门题
- 随手小记(php)
- 使myeclipse新建jsp的默认编码为UTF-8
- Autorun.inf语法 光盘自动播放 磁盘自动播放 文件详解
- C++中const使用总结
- 中断(Interrupt)与异常(Exception)
- hdoj1258
- POJ 2140 Herd Sums (发道水题)
- J2EE项目中异常处理
- asp中sql 语句删除access数据记录的几种方式
- BOTTLE的高级技巧
- JAVA异常设计原则
- POJ 1274 The Perfect Stall (第一道二分图最大配对)
- 获取网络时间
- uva 571 jugs