HDOJ --- 1258

 #include<map>
 #include<string>
 #include<cstdio>
 #include<cstring>
 #include<iostream>
 #include<algorithm>
 #define MAXN 20
 using namespace std;
 int a[MAXN], temp[MAXN], vis[MAXN];
 int T, N, flag, sum;
 string ss;
 char str[MAXN];
 map<string, int>mp;
 bool cmp(int a, int b){return a > b;}
 void dfs(int dep, int idx){
     if(sum > T) return;
     if(idx == N && sum != T) return;
     if(sum == T){
         flag ++;
         if(flag == ) printf("Sums of %d:\n", T);
         for(int i = ; i < dep; i ++) str[i] = temp[i];
         ss.clear();
         ss = str;
         mp[ss]++;
         if(mp[ss] == ){
             for(int i = ; i < dep-; i ++) printf("%d+", temp[i]);
             printf("%d\n", temp[dep-]);
         }
         return;
     }
     for(int i = idx; i < N; i ++){
         if(!vis[i]){
             vis[i] = ;
             temp[dep] = a[i];
             sum += a[i];
             dfs(dep+, i+);
             sum -= a[i];
             vis[i] = ;
         }
     }
 }
 int main(){
     int tt;
     /* freopen("in.c", "r", stdin); */
     while(~scanf("%d%d", &T, &N) && N+T){
         tt = ;
         memset(vis, , sizeof(vis));
         for(int i = ; i < N; i ++) scanf("%d", a+i),tt += a[i];
         if(tt < T){
             printf("Sums of %d:\nNONE\n", T);
             continue;
         }
         sort(a, a+N, cmp);
         mp.clear();
         sum = flag = ;
         dfs(, );
         if(!flag) printf("Sums of %d:\nNONE\n", T);
     }
     return ;
 }