HDU 1268 Sum It Up【DFS】
2015-04-10 17:11
316 查看
Sum It Up
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4597 Accepted Submission(s): 2372
[align=left]Problem Description[/align]
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.
[align=left]Input[/align]
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.
[align=left]Output[/align]
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.
[align=left]Sample Input[/align]
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
[align=left]Sample Output[/align]
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
题目不难,但学习了如何避免重复的数据
#include<cstdio> #include<iostream> #include<algorithm> #include<cmath> #include<cstring> using namespace std; #define maxn 15 int arr[maxn]; int out[maxn]; int t,n; bool flag; void dfs(int sum,int x,int cnt); bool check(int cnt); int main(){ while(scanf("%d%d",&t,&n) != EOF && t+n){ flag = false; for(int i = 0 ; i < n; i++){ scanf("%d",&arr[i]); } printf("Sums of %d:\n",t); dfs(0,0,0); if(!flag){ printf("NONE\n"); } } return 0; } void dfs(int sum,int x,int cnt){ if(sum > t){ return ; } if(sum == t){ flag = true; for(int i = 0;i < cnt-1;i++){ printf("%d+",out[i]); } printf("%d\n",out[cnt-1]); return; } int tmp = -1; for(int i = x; i < n; i++){ if(arr[i] != tmp){ out[cnt] = arr[i]; tmp = arr[i]; dfs(sum+arr[i],i+1,cnt+1); } } }
相关文章推荐
- hdu 1258 Sum It Up(DFS)
- poj1564 Sum It Up (zoj 1711 hdu 1258) DFS
- HDU 1258 Sum It Up (DFS)
- hdu 1258 Sum It Up(dfs)
- HDU 1258 (DFS) Sum It Up
- HDU 1258 Sum It Up(DFS)
- Sum It Up POJ 1564 HDU 杭电1258【DFS】
- hdu 1258 Sum It Up (dfs)
- HDU 1258 Sum It Up(DFS)
- HDU 1258 Sum it up 搜索DFS
- HDU 1258Sum It Up(暴力dfs,记住相同的状态只保留一个)
- HDU 1258 Sum It Up DFS
- HDU 1258 Sum It Up (dfs)
- POJ 1564 && HDU 1258 Sum It Up(dfs)
- poj 1564 Sum It Up | zoj 1711 | hdu 1548 (dfs + 剪枝 or 判重)
- POJ 1564(HDU 1258 ZOJ 1711) 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)