hdu 1258 Sum It Up
来源:互联网 发布:陈丹丹淘宝店叫什么 编辑:程序博客网 时间:2024/06/05 04:42
http://acm.hdu.edu.cn/showproblem.php?pid=1258
Sum It Up
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
///#pragma comment (linker, "/STACK:102400000,102400000")#include <iostream>#include <queue>#include <cstdio>#include <cstring>#include <algorithm>#include <cmath>#include <cstdlib>#include <limits>#include <stack>#include <vector>#include <map>using namespace std;#define N 10001#define INF 0xfffffff#define PI acos (-1.0)#define EPS 1e-8int n, sum, a[N], b[N], flag;bool cmp (int a, int b){ return a > b;}void DFS (int posl, int ans, int s);int main (){ while (scanf ("%d %d", &sum, &n), sum+n) { for (int i=0; i<n; i++) scanf ("%d", &a[i]); sort (a, a+n, cmp); flag = 0; printf ("Sums of %d:\n", sum); DFS (0, 0, 0); if (!flag) puts ("NONE"); } return 0;}void DFS (int pos, int ans, int s){ if (sum == s) { flag = 1; sort (b, b+ans, cmp); for (int i=0; i<ans; i++) { if (!i) printf ("%d", b[i]); else printf ("+%d", b[i]); } puts (""); } for (int i=pos; i<n; i++) { if (s + a[i] <= sum) { b[ans] = a[i]; DFS (i+1, ans+1, s+a[i]); while (i+1<n && a[i] == a[i+1]) i++; } }}
0 0
- hdu 1258 Sum It Up
- HDU 1258 sum it up
- HDU-1258-Sum It Up
- HDU 1258 Sum It Up
- hdu 1258 sum it up
- HDU 1258 - Sum It Up
- hdu 1258 Sum It Up
- hdu 1258 Sum It Up
- hdu 1258 Sum It Up
- (hdu) 1258 Sum It Up
- HDU 1258 Sum It Up
- HDU 1258:Sum It Up
- hdu-1258 Sum It Up
- hdu 1258 Sum It Up
- HDU 1258 Sum It Up
- HDU 1258 Sum It Up
- hdu 1258 Sum It Up
- hdu 1258 Sum It Up
- Android动画学习笔记-Android Animation
- PHP获取Cookie模拟登录CURL
- HDU 1848 Fibonacci again and again(SG函数)
- 【Android源码解析】选择多张图片上传多图预览
- [效率提升]工作中的那些命令行
- hdu 1258 Sum It Up
- POJ-1258Agri-Net
- Android百度地图SDK 导航SDK2.0结合定位SDK6.0.5的导航参数设置方法
- Android 历史 基本框架
- POJ 2418 Hardwood Species(字典树)
- 解密SVM系列(四):SVM非线性分类原理实验
- 1095
- HDOJ Matrix multiplication 4920【矩阵相乘】
- 关于Linealayout 各item点击效果,比较不错的selector