1. 题目源地址:http://acm.hdu.edu.cn/showproblem.php?pid=1258
2. 源代码:
//HOJ--1258:Sum It Up
#include<iostream>
#include<memory.h>
#include<algorithm>
using namespace std;
int total,N,cnt;
int value[15],ans[15];
int cmp(int a,int b)
{
return a>b;
}
void DFS(int x,int pos1,int sum,int pos2)
{
int i,j;
if(sum>total) return ;
if(sum==total)
{
cnt++;
for(i=0;i<pos2;i++)
{
if(i) cout<<"+"<<ans[i];
else cout<<ans[i];
}
cout<<endl;
}
for(i=pos1;i<N;i++)
{
ans[pos2]=value[i];
DFS(value[i],i+1,sum+value[i],pos2+1);
while(i+1<N && value[i]==value[i+1])//搜索完毕后,若下一个搜索的数仍与当前相同,则跳过直至不相同
i++;
}
}
int main()
{
int i,j;
while(cin>>total>>N && (total||N))
{
for(i=0;i<N;i++)
cin>>value[i];
sort(value,value+N,cmp);
cout<<"Sums of "<<total<<":"<<endl;
cnt=0;
DFS(0,0,0,0);
if(!cnt) cout<<"NONE"<<endl;
}
return 0;
}