传送门:http://acm.hdu.edu.cn/showproblem.php?pid=1258
在数列进入dfs函数之前非递增排序,即可保证按要求输出。
在回溯的时候把该节点相同的数过滤掉,即可保证不重复。
#include <cstdio>
#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
const int N = 10000;
int sum,t,ok,flag;
int a[N];
int b[N];
int CMP(const void* a,const void* b)
{
int * n = (int *)a;
int * m = (int *)b;
return *m - *n;
}
void dfs(int cura,int curb,int sum1)
{
if(sum1 == sum){
ok = 1;
for(int i = 0;i<curb;i++){
if(i == 0)printf("%d",b[i]);
else cout << "+" << b[i];
}
printf("\n");
return;
}
if(sum1>sum || cura >= t)return;
b[curb] = a[cura];
dfs(cura+1,curb+1,sum1+a[cura]);
int i =1;
while(a[cura+i] == a[cura]){i++;}///过滤相同根节点生成的子树
dfs(cura+i,curb,sum1);
}
int main()
{
while(scanf("%d%d",&sum,&t) == 2){
if(sum == 0&&t == 0)break;
flag = ok = 0;
for(int i = 0;i<t;i++){
scanf("%d",&a[i]);
}
qsort(a,t,sizeof(a[0]),CMP);///从大到小排列
printf("Sums of %d:\n",sum);
dfs(0,0,0);
if(!ok)printf("NONE\n");
}
return 0;
}