Sum It Up(DFS+剪枝+去重)
来源:互联网 发布:淘宝怎么找学位证办理 编辑:程序博客网 时间:2024/05/21 09:12
Link:http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemId=711
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 file 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 x 1 , . . . , x n . 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 x 1 , . . . , x n 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 distinct; the same sum cannot 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
AC code:
#include<iostream>#include<algorithm>#include<cstring>#include<cstdio>#include<queue>#include<map>#include<cmath>using namespace std;int ans,A,a[13],n,b[13],cnt=0,fg;bool vis[13];void dfs(int s){if(s==A){fg=1;printf("%d",b[1]);for(int j=2;j<=cnt;j++){printf("+%d",b[j]);}puts("");//ans++;return;}for(int i=1;i<=n;i++){if(!vis[i]&&s+a[i]<=A){if(cnt>0&&b[cnt]<a[i])//确保格式从大到小{continue;}b[++cnt]=a[i];vis[i]=true;s+=a[i];dfs(s);vis[i]=false;cnt--;s-=a[i];while(i+1<=n&&a[i+1]==a[i])<span style="color: rgb(51, 51, 51); font-family: 宋体; font-size: 14px; line-height: 28px;">//搜索完毕后,若下一个搜索的数仍与当前相同,则寻找下一个不同的数进行搜索。{去重} </span>{i++;}}}}int main(){ int i; while(~scanf("%d",&A)) { scanf("%d",&n); if(A==0&&n==0) { break;} for(i=1;i<=n;i++) { scanf("%d",&a[i]);}memset(vis,false,sizeof(vis));fg=0;cnt=0;//ans=0; printf("Sums of %d:\n",A);dfs(0);if(!fg){printf("NONE\n");}//printf("%d\n",ans);}return 0; }
- Sum It Up(DFS+剪枝+去重)
- ZOJ1711-sum it up(DFS+去重)
- POJ 题目1564 Sum It Up(DFS,去重)
- HDU 1258 Sum It Up (dfs+去重)
- 【HDU 1258】Sum It Up(DFS,去重技巧)
- ZOJ(1711)Sum It Up (DFS+剪枝+去重复)
- zoj 1711 || poj 1564 Sum It Up(DFS~~~去重~)
- POJ 1564 Sum It Up (DFS+剪枝)
- hdu 1258 Sum it up dfs+剪枝
- poj 1564 Sum It Up | zoj 1711 | hdu 1548 (dfs + 剪枝 or 判重)
- dfs去重(剪枝)
- HDU1258 Sum It Up 【DFS】+【判重】
- Sum It Up(DFS)
- ZOJ1711 POJ1564 Sum It Up,DFS+输出排序+去重复
- hdu 1258 Sum It Up(DFS)
- POJ 1564 Sum It Up(DFS)
- hdu 1258 Sum It Up(dfs)
- hdu1258 Sum It Up(dfs)
- C#中的ListBox应用
- PAT B1032 挖掘机技术哪家强
- 空、。。
- PAT A1011 World Cup betting
- Linux下的计划任务:crontab命令详解
- Sum It Up(DFS+剪枝+去重)
- 内部类
- Use apache pig to process the MovieLens datasets --- recommend system
- 在hp-ux下安装oracle 数据库软件时unzip的问题
- uvalive4094
- myeclipse错误: 找不到或无法加载主类
- 用C/C++获取CPU温度总结(一)
- android开发中关于VersionCode和VersionName
- OpenCV Using Python——应用统计肤色模型和相对于块原点能量的肤色分割