hdoj1258
来源:互联网 发布:cad服装制图软件 编辑:程序博客网 时间:2024/06/17 03:28
Sum It Up
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3006 Accepted Submission(s): 1509
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被这道题坑死了,其实还算简单,但要千万要注意如何去重,我就是再去重上调了半天。思路就是深度优先遍历代码:#include<iostream>#include<cstring>#include<algorithm>#include<climits>#include<cstdio>using namespace std;int a[15];int vis[15];int b[15];int t,n;bool com(int a,int b){ return a>b;}bool dfs(int p,int sum,int num){ if(sum==t) { cout<<b[1]; for(int i=2;i<num;i++) cout<<'+'<<b[i]; cout<<endl; return true; } if(sum>t) { return false; } int flag=0; for(int i=p;i<=n;i++) { if(!vis[i]&&a[i]<=b[num-1]) {//去重if(i>p&&a[i]==a[i-1]) continue; vis[i]=1; sum+=a[i]; b[num]=a[i]; if(dfs(i+1,sum,num+1)) flag=1; sum-=a[i]; vis[i]=0; } } if(flag) { return true; } else { return false; }}int main(){//freopen("in.txt","r",stdin); while(cin>>t>>n,t&&n) { memset(vis,0,sizeof(vis)); memset(b,0,sizeof(b)); b[0]=a[0]=INT_MAX; for(int i=1;i<=n;i++) { cin>>a[i]; } sort(a+1,a+n+1,com); cout<<"Sums of "<<t<<":"<<endl; if(!dfs(1,0,1)) cout<<"NONE"<<endl; } return 0;}
- hdoj1258
- hdoj1258
- HDOJ1258 又是一道深搜入门题
- IIS7下,flush无效,解决方案
- 每日一题(58) - 从1到n整数中1出现的次数
- 第四章C#流程控制
- DSP TMS320C6000基础学习(6)—— gel文件
- Java的的三元运算符
- hdoj1258
- java.net.UnknownHostException
- [iphone]Code Sign error: Provisioning profile XXXX can't be found
- UVALive 3983 Robotruck
- UVA 590 - Always on the run (dp)
- XDU 1010 素数环
- 求数组中的逆序对(来源于剑指名企offer)
- VIJOS P1037 搭建双塔
- iOS extracts: CGAffineTransformInvert