dfs:Sum It Up

Description
Given a specified total t and a list of n integers, find all distinct sums using numbers from the list that add up to t. For example, if t=4, n=6, and the list is [4,3,2,2,1,1], then there are four different sums that equal 4: 4,3+1,2+2, and 2+1+1.(A number can be used within a sum as many times as it appears in the list, and a single number counts as a sum.) Your job is to solve this problem in general.

Input
The input will contain one or more test cases, one per line. Each test case contains t, the total, followed by n, the number of integers in the list, followed by n integers x1,…,xn. If n=0 it signals the end of the input; otherwise, t will be a positive integer less than 1000, n will be an integer between 1 and 12(inclusive), and x1,…,xn will be positive integers less than 100. All numbers will be separated by exactly one space. The numbers in each list appear in nonincreasing order, and there may be repetitions.

Output
For each test case, first output a line containing ‘Sums of’, the total, and a colon. Then output each sum, one per line; if there are no sums, output the line ‘NONE’. The numbers within each sum must appear in nonincreasing order. A number may be repeated in the sum as many times as it was repeated in the original list. The sums themselves must be sorted in decreasing order based on the numbers appearing in the sum. In other words, the sums must be sorted by their first number; sums with the same first number must be sorted by their second number; sums with the same first two numbers must be sorted by their third number; and so on. Within each test case, all sums must be distince; the same sum connot appear twice.

Sample Input
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

Sample Output
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 <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <string>
#include <vector>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <cctype>
#include <cstdlib>
#include <sstream>
#define sqr(x) ((x)*(x))
#define lson le,mid,rt<<1
#define rson mid+1,ri,rt<<1|1
#define inf 0x3f3f3f3f
#define eps 1e-6
typedef long long ll;
using namespace std;
const double PI = 4.0*atan(1.0);
const int maxn =10 ;

int t,n,s[100],flag;
int res[100];

void dfs(int sum,int index,int front)
{
    if(sum>t)
        return;
    if(sum==t)
    {
        flag=1;
        printf("%d",res[0]);
        for(int i=1; i<index; i++)
            printf("+%d",res[i]);
        printf("\n");
        return;
    }
    for(int i=front-1; i>=0; i--)
    {

        res[index]=s[i];
        dfs(sum+s[i],index+1,i);
        while(i-1>=0 && s[i] == s[i-1])//搜索完毕后，若下一个搜索的数仍与当前相同，则跳过直至不相同
            i--;
    }
}
int main()
{
    while(scanf("%d%d",&t,&n)&&n)
    {
        flag=0;
        for(int i=0; i<n; i++)
            scanf("%d",&s[i]);
        sort(s,s+n);
        printf("Sums of %d:\n",t);
        dfs(0,0,n);
        if(!flag)
            printf("NONE\n");
    }
    return 0;
}

Reflect:
1，要想实现题目要求的输出方式，则首先要对原数据排序，并且从最大的那个数开始进行操作；
2，因为题中所给数字有重复的，所以需要对答案进行去重处理：
a,front代表前面一个数的下标，后面枚举的数不可以大于此数（否则就是全排列）；
b,下一次枚举的数不可以和上一次枚举的数一样，要一直找到下一个不一样的数；