HDU 1258 Sum It Up (dfs+去重)
来源:互联网 发布:stm8中文数据手册 编辑:程序博客网 时间:2024/06/16 16:23
Sum It Up Problem DescriptionGiven 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.
InputThe 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.
OutputFor 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 Input4 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 OutputSums 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
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
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
dfs加上去重。。虽然简单但是没做过一次还真不会去重。。就一小行代码,在搜完之后while一下,如果后面有和前面一样的数字跳掉
代码:
#include<algorithm>#include<iostream>#include<cstring>#include<cstdio>#include<math.h>#include<string>#include<stdio.h>#include<queue>#include<stack>using namespace std;int n,t;int a[20],b[20],f[20],tag;void dfs(int s,int num,int d){ int i,j; if(s==t) { for(i=0;i<num;i++) { printf("%d",b[i]); if(i!=num-1) printf("+"); else printf("\n"); } tag=1; return; } if(s>t) return; for(i=d;i<n;i++) { if(num!=0&&b[num-1]<a[i]) continue; b[num]=a[i]; dfs(s+a[i],num+1,i+1); while(i+1<n&&a[i]==a[i+1]) i++; }}int main(){ int i,j,ad; while(scanf("%d%d",&t,&n)!=EOF) { if(t==0&&n==0) break; ad=0; for(i=0;i<n;i++) { scanf("%d",&a[i]); ad+=a[i]; } printf("Sums of %d:\n",t); if(ad<t) { printf("NONE\n"); continue; } tag=0; dfs(0,0,0); if(!tag) { printf("NONE\n"); } } return 0;}
阅读全文
0 0
- HDU 1258 Sum It Up (dfs+去重)
- 【HDU 1258】Sum It Up(DFS,去重技巧)
- ZOJ1711-sum it up(DFS+去重)
- POJ 题目1564 Sum It Up(DFS,去重)
- Sum It Up(DFS+剪枝+去重)
- hdu 1258 Sum It Up(DFS)
- hdu 1258 Sum It Up(dfs)
- HDU 1258 Sum It Up (DFS)
- HDU 1258 Sum It Up(DFS)
- HDU 1258 Sum It Up(DFS)
- hdu-1258-Sum It Up(DFS)
- zoj 1711 || poj 1564 Sum It Up(DFS~~~去重~)
- hdu 1258 Sum It Up(dfs)
- hdu 1258 Sum It Up dfs
- HDU 1258 Sum It Up DFS
- HDU 1258 Sum it up 搜索DFS
- HDU--1258:Sum It Up (DFS)
- hdu 1258 Sum It Up (dfs)
- Android App专项测试—压力测试
- hdu 2072
- 六、原型模式——设计模式学习笔记
- Hibernate的Connection.TRANSACTION_REPEATABLE_READ误区
- JavaWeb学习总结(十四)——JSP原理
- HDU 1258 Sum It Up (dfs+去重)
- CSS—选择器
- CSDN博客个人主页左侧栏添加微信二维码
- Android基础之Activity
- 【Zynq学习笔记4】问题汇总
- java线程join()源码中wait()和isAlive()的问题
- HTML基础-认识HTML 01
- AE,线、面转多点
- mybatis中trim标签的使用