Sum It Up(hdu1258,dfs)
来源:互联网 发布:免费下载淘宝网2016 编辑:程序博客网 时间:2024/05/16 16:13
http://acm.hdu.edu.cn/showproblem.php?pid=1258
Sum It Up
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 3101 Accepted Submission(s): 1559
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 1
5 3 2 1 1
400 12 50 50 50 50 50 50 25 25 25 25 25 25
0 0
Sample Output
Sums of 4:
4
3+1
2+2
2+1+1
Sums of 5:
NONE
Sums of 400:
50+50+50+50+50+50+25+25+25+25
50+50+50+50+50+25+25+25+25+25+25
Source
浙江工业大学第四届大学生程序设计竞赛
Recommend
JGShining
15MS 296K 944 B C++
*/
#include<stdio.h> #include<string.h> #include<algorithm> #include<iostream> using namespace std; const int maxn=1000+10; int a[maxn],b[maxn],vis[maxn]; int sum,tot,n,ok; bool cmp(int a,int b) { return a>b; } void dfs(int v,int s) { if(s==sum) {ok=1; s=0; for(int i=0;i<tot;i++) { printf("%d",b[i]); if(i<tot-1) printf("+"); else printf("\n"); } return; } int last=-1; for( int i=v;i<n;i++)//每次都是从新的起点开始 { if(last!=a[i]&&s+a[i]<=sum)//判断起点是否重复 { last=a[i]; b[tot++]=a[i]; dfs(i+1,s+a[i]); tot--;//这里有一个回溯 } } } int main() { int i,j; while(scanf("%d%d",&sum,&n)!=EOF&&!(sum==0&&n==0)) { ok=0; for(i=0;i<n;i++) scanf("%d",&a[i]); sort(a,a+n,cmp); memset(vis,0,sizeof(vis)); tot=0; printf("Sums of %d:\n",sum); dfs(0,0); if(!ok) printf("NONE\n"); } system("pause"); return 0; }
- HDU1258:Sum It Up(DFS)
- hdu1258 Sum It Up (DFS)
- Sum It Up(hdu1258,dfs)
- HDU1258:Sum It Up(DFS)
- HDU1258:Sum It Up(DFS)
- DFS hdu1258 Sum It Up
- HDU1258 Sum It Up(DFS)
- HDU1258 Sum It Up 【DFS】+【判重】
- HDU1258 POJ1564 Sum It Up DFS
- hdu1258 Sum It Up(dfs)
- HDU1258 Sum It Up(DFS)
- HDU1258 Sum It Up (DFS)
- HDU1258 Sum It Up
- HDU1258:Sum It Up
- Sum It Up hdu1258
- HDU1258 Sum it up
- HDU1258 Sum It Up
- hdu1258(Sum It Up)
- STM32 IAP 设计实例 (二)
- linux批量替换文件内容3种方法(perl,sed,shell)
- 读《巨流河》
- worldwind学习笔记-2-WorldWindowGLCanvas
- 面试的一点积累
- Sum It Up(hdu1258,dfs)
- MyEclipse:Available memory is low解决办法
- VS2008提示无法打开包括文件:“afxcontrolbars.h”解决办法
- 外部排序技术之多路归并
- android对话框存在时,有时无法捕获back键
- Asteroids!(hdu1240,dfs)
- Don't Get Rooked(poj1315,dfs)
- Activity启动模式
- C++函数适配器