HDU 1258 Sum It Up(DFS)
来源:互联网 发布:淘宝商品质量问题定义 编辑:程序博客网 时间:2024/05/17 06:15
Sum It Up
Time Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)
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
这道题就简单的深搜一下就可以了,注意避免重复。
AC代码:
#include<iostream>#include<algorithm>#include<cstring>#include<queue>#include<cstdio>using namespace std;int mp[13];int res[13];int sum,n;bool flag;bool cmp(int a,int b){return a>b;}void dfs(int posa,int posb,int cnt){if(cnt>sum)return ;if(cnt==sum){int p=0;flag=1;for(int i=0;i<posb;i++){if(p++)cout<<"+";cout<<res[i];}cout<<endl;return ;}for(int i=posa;i<n;i++){res[posb]=mp[i];dfs(i+1,posb+1,cnt+mp[i]);while(i+1<n&&mp[i]==mp[i+1])i++;}}int main(){int res[13];while(cin>>sum>>n&&sum&&n){for(int i=0;i<n;i++)cin>>mp[i];flag=0;sort(mp,mp+n,cmp);printf("Sums of %d:\n",sum);dfs(0,0,0);if(!flag)cout<<"NONE"<<endl;}return 0;}
阅读全文
0 0
- 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)
- 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)
- hdu 1258 Sum It Up(dfs)
- HDU 1258 Sum It Up (还是DFS)
- hdu 1258 Sum it up dfs+剪枝
- HDOJ(HDU).1258 Sum It Up (DFS)
- hdu 1258 Sum It Up dfs暴搜
- HDU 1258 (DFS) Sum It Up
- Android
- 基于深度学习的商品检索技术
- 《黑科技》
- win10完美去除快捷方式小箭头的方法
- 最近公共祖先(LCA)及其倍增算法实现
- HDU 1258 Sum It Up(DFS)
- (转)并查集详解 杭电1232畅通工程为例
- x-ray图像增强算法
- 实习日志-5
- hadoop2.72集群搭建(亲自实验,技术内容部分转自他人博客)
- C语言中.h文件和.c文件详细解析
- linux下sqlite3的使用
- Java RMI 远程方法调用 基础
- 使用 Node.js 的 nodemailer 模块发送邮件(支持 QQ、163 等、支持附件)