POJ 1564 Sum It Up（DFS）

Sum It Up

Time Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64u

Submit Status

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

题目简单翻译：

给一个数n,然后给一个数m，接下来m个数，问有多少种情况使得若干个取自m个数中的数的和为n。没有则输出NONE

解题思路：

dfs，然后注意去重；

代码：

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int n,m;
int t[20];
int Ans_Array[20];
bool cmp(const int &a,const int &b)
{
    return a>b;
}
int Find;
void dfs(int now,int length,int Sum)
{
    if(Sum==n)
    {
        Find=1;
        for(int i=0;i<length;i++)
        {
            if(i) printf("+");
            printf("%d",Ans_Array[i]);
        }
        printf("
");
        return;
    }
    for(int i=now+1;i<m;i++)
    {
        if(t[i]<=n-Sum&&(i==now+1||t[i]!=t[i-1]))//这是去重和剪枝
        {
            Ans_Array[length]=t[i];
            dfs(i,length+1,Sum+t[i]);
        }
    }
}
void solve()
{
    Find=0;
    for(int i=0;i<m;i++)
    {
        if(t[i]<=n&&(i==0||t[i]!=t[i-1]))//这是去重和剪枝
        {
            Ans_Array[0]=t[i];
            dfs(i,1,t[i]);
        }
    }
}
int main()
{
    while(scanf("%d%d",&n,&m)!=EOF&&(n||m))
    {
        for(int i=0;i<m;i++) scanf("%d",&t[i]);
        sort(t,t+m,cmp);
        printf("Sums of %d:
",n);
        solve();
        if(!Find) puts("NONE");
    }
    return 0;
}