From Evernote:

uva 574

是個遞迴題

[sourcecode language="cpp"]
//============================================================================
// Name : Sum It Up.cpp
// Date : 2013 2013/3/2 下午11:37:31
// Author : GCA
//============================================================================
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <climits>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <cctype>
#include <utility>
using namespace std;
typedef long long ll;
typedef unsigned int uint;
#define Set(a,s) memset(a,s,sizeof(a))
#define Write(w) freopen(w,"w",stdout)
#define Read(r) freopen(r,"r",stdin)
#define Pln() printf("\n")
#define I_de(x,n)for(int i=0;i<n;i++)printf("%d ",x[i]);Pln()
#define De(x)printf(#x"%d\n",x)
#define For(i,x)for(int i=0;i<x;i++)
#define CON(x,y) x##y
#define Pmz(dp,nx,ny)for(int hty=0;hty<ny;hty++){for(int htx=0;htx<nx;htx++){\
printf("%d ",dp[htx][hty]);}Pln();}
#define M 100005
#define PII pair<int,int>
#define PB push_back
#define oo INT_MAX
#define Set_oo 0x3f
#define Is_debug true
#define debug(...) if(Is_debug)printf("DEBUG: "),printf(__VA_ARGS__)
#define FOR(it,c) for(__typeof((c).begin()) it=(c).begin();it!=(c).end();it++)
#define RFOR(it,c) for(__typeof((c).rbegin()) it=(c).rbegin();it!=(c).rend();it++)
#define eps 1e-6
bool xdy(double x,double y){return x>y+eps;}
bool xddy(double x,double y){return x>y-eps;}
bool xcy(double x,double y){return x<y-eps;}
bool xcdy(double x,double y){return x<y+eps;}
int min3(int x,int y,int z){
int tmp=min(x,y);
return min(tmp,z);
}
int max3(int x,int y,int z){
int tmp=max(x,y);
return max(tmp,z);
}
int sum,lnum;
int list[50];
vector<int> ans[10000],tmp;
int ansnum=0,judge=0;
int no;
bool cmp(int x,int y){return x<y;}
void dfs(int x,int nowsum,int d){
if(nowsum>sum)return;
if(nowsum==sum){
printf("%d",tmp[0]);
for(uint i=1;i<tmp.size();i++)printf("+%d",tmp[i]);
Pln();
no=0;
return;
}

int tmp2=-1;
for(int i=x;i<lnum;i++){
if(tmp2!=list[i]){
tmp2=list[i];
// if(judge){judge=0;break;}
tmp.PB(list[i]);
dfs(i+1,list[i]+nowsum,d+1);
tmp.pop_back();
}
}

}
int main() {
ios_base::sync_with_stdio(0);
while(~scanf("%d %d",&sum,&lnum)&&sum+lnum){
ansnum=0;
judge=0;
no=1;
for(int i=0;i<lnum;i++)scanf("%d",&list[i]);
// sort(list,list+lnum,cmp);
printf("Sums of %d:\n",sum);
dfs(0,0,0);
if(no)printf("NONE\n");
}

}

[/sourcecode]