Sum It Up（DFS）

Problem 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 file 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 x 1 , … , x n . 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 x 1 , … , x n 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 lineNONE’. 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 distinct; the same sum cannot 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

Source
Mid-Central USA 1997
题意：给出所求的sums——t（小于1000）,和集合的位数n（不大于12），后面是n个非递增的数（小于100），从给定的n个数中先取若干个的数等于t, 不能出现重复等式，每个数只用一次！

分析：此题比较难写的是判重，不能使等式出现重复. 由此想到八数码问题， 有哈希，set，编码解码等判重，那么这道题也能用哈希，set判重

1.set判重

#include<cstdio>
#include<set>
#include<iostream>
#include<algorithm>
#include<string>
using namespace std;
int n,t,a[20],b[20],flag;
set<string>st;
void dfs(int sum,int pos,int cnt)//sum为当前的和，cnt是式子中数字的个数，pos是记录等式数字的下标
{
    if(sum>t) return;//剪枝
    if(sum==t)
    {
        flag=1;///输出等式标记
        string ans="";
        for(int i=1; i<=cnt; i++)
            ans+=(b[i-1]+'0');
        if(st.count(ans)==0)
            for(int i=1; i<=cnt; i++)
            {
                if(i!=cnt) printf("%d+",b[i-1]);
                else printf("%d\n",b[i-1]);
            }
        st.insert(ans);
    }
    for(int i=pos; i<n; i++)
    {
        b[cnt]=a[i];///数组b记录输出等式的数字
        cnt++;
        dfs(sum+a[i],i+1,cnt);
        cnt--;
    }
}
int main()
{
    while(~scanf("%d%d",&t,&n)&&t&&n)
    {
        for(int i=0; i<n; i++)
            scanf("%d",&a[i]);
        printf("Sums of %d:\n",t);
        flag=0;
        dfs(0,0,0);
        if(!flag)
            puts("NONE");
    }
    return 0;
}

2.循环判重

#include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;
int n,t,a[20],b[20],flag;
void dfs(int sum,int pos,int cnt)
{
    if(sum>t) return;
    if(sum==t)
    {
        flag=1;
        for(int i=1; i<=cnt; i++)
        {
            if(i!=cnt)
                printf("%d+",b[i-1]);
            else printf("%d\n",b[i-1]);
        }
    }
    for(int i=pos; i<n; i++)
    {
        b[cnt]=a[i];
        cnt++;
        dfs(sum+a[i],i+1,cnt);
        cnt--;
        while(i+1<n&&a[i+1]==a[i])///跳过前后两个数相同的情况，避免出现重复的等式
            i++;
        //printf("%d %d %d %d\n",pos,i,cnt,sum);
    }
}

3.哈希表判重
…