题意:给定一个数sum,以及n个数s1~sn,在给定的n个数中找出若干个数和为sum,输出所有无重复的方案。要求每个方案中的数非减排序,不同方案按照第一个数非减排序,若第一个数相同就按照第二个数非减排序。
思路:dfs,因为有重复数据,所以用一个used数组记录重数。
输入:
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
输出:
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 <stdio.h>
#include <string.h>
#define N 17
int sum,n,num,top,flag;
int s[N],used[N],res[N];//s记录数据,used记录个数,res记录结果
void dfs(int depth){
int i,j,k;
if(depth == n)
return ;
for(i = used[depth];i>=0;i--){//可以保证没有重复
if(s[depth]*i+num>sum)
continue;
if(s[depth]*i+num == sum){
flag = 1;
for(j = 1;j<depth;j++)
if(res[j])
for(k = 0;k<res[j];k++)
printf("%d+",s[j]);
for(k = 1;k<i;k++)
printf("%d+",s[depth]);
printf("%d\n",s[depth]);
continue;
}
res[depth] = i;
num += i*s[depth];
dfs(depth+1);
num -= i*s[depth];
}
}
int main(){
freopen("a.txt","r",stdin);
while(scanf("%d %d",&sum,&n)&&(n+sum)){
int i,j,temp;
num = flag = 0;
top = -1;
s[0] = 0;
memset(used,0,sizeof(used));
memset(res,0,sizeof(res));
for(i = j = 1;i<=n;i++){
scanf("%d",&temp);
if(temp != s[j-1])
s[j++] = temp;
used[j-1]++;
}
n = j;
printf("Sums of %d:\n",sum);
dfs(1);
if(!flag)
printf("NONE\n");
}
return 0;
}
法二:直接在末尾添加元素。
#include <cstdio>
#include <cstring>
#include <string>
#include <cstdlib>
#include <vector>
#include <queue>
#include <algorithm>
#include <cmath>
#include <set>
#include <iostream>
#define N 105
#define INF 0x3fffffff
using namespace std;
int n,m;
void solve(vector<vector<int> > &res,vector<int> &s,vector<int>&tmp,int from,int d){
if(d == 0){
res.push_back(tmp);
return;
}
for(int i = from;i<s.size();++i)
if(d>=s[i] && (i == from || s[i]!=s[i-1])){
tmp.push_back(s[i]);
solve(res,s,tmp,i+1,d-s[i]);
tmp.pop_back();
}
}
int main(){
while(scanf("%d %d",&m,&n) && (n + m)){
vector<int> s;
for(int i = 0;i<n;i++){
int x;
scanf("%d",&x);
s.push_back(x);
}
sort(s.begin(), s.end(), greater<int>());
vector<vector<int> > res;
vector<int> tmp;
solve(res,s,tmp,0,m);
printf("Sums of %d:\n",m);
if(res.size() == 0)
printf("NONE\n");
else{
for(int i = 0;i<res.size();i++){
for(int j = 0;j<res[i].size();j++){
if(j)
putchar('+');
printf("%d",res[i][j]);
}
printf("\n");
}
}
}
return 0;
}