HDU 1258 Sum It Up DFS

Sum It Up

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 3984    Accepted Submission(s): 2055

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 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 15 3 2 1 1400 12 50 50 50 50 50 50 25 25 25 25 25 250 0

Sample Output

Sums of 4:43+12+22+1+1Sums of 5:NONESums of 400:50+50+50+50+50+50+25+25+25+2550+50+50+50+50+25+25+25+25+25+25

/*HDOJ 1258 DFS*/#include<iostream>#include<stdio.h>#include<algorithm>using namespace std;int t,n,flag;int map[13],s[13];int cmp(int x,int y){    return x>y;}void DFS(int i,int count,int sum){    int k,last;    if(sum>t) return ;    if(sum==t)    {        printf("%d",s[0]);        for(i=1;i<count;i++)            printf("+%d",s[i]);        printf("\n");        flag=1;        return ;    }    last=-1;    for(k=i;k<n;k++)    {        if(map[k]!=last    ) //当前的数不能跟上一次搜索的起点的数值一样，不然会造成重复        {            s[count]=map[k];            last=map[k];//last保存当前搜索的起点            DFS(k+1,count+1,sum+map[k]);        }    }    return ;}int main(){    int i;    while(scanf("%d%d",&t,&n)&&(n+t))    {        for(i=0;i<n;i++)            scanf("%d",&map[i]);        printf("Sums of %d:\n",t);        sort(map,map+n,cmp);        DFS(0,0,0);                if(!flag)            printf("NONE\n");        flag=0;    }        return 0;}