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.
InputThe 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.
OutputFor 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
InputThe 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.
OutputFor 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 0Sample 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
题意:给出两个数 sum n ;接下来n个数,询问有多少种可能是这n个数中的任意个数之和为sum
思路:基础dfs可以计算出有多少种可能,但因为要记录路径,所以得开一个pre数组,储存上一个位置.
#include<stdio.h>
#include<string.h>
#include<stack>
using namespace std;
int pre[1005];//储存上一个位置
int m[1005];
int Sum,n;
int flag ;
void dfs(int sum, int len)
{
if(sum == Sum)///如果符合要求,输出路径
{
flag = 0;
stack<int>s;//栈
while(len!=-1)//把路径存入栈
{
s.push(m[len]);
len = pre[len];
}
printf("%d",s.top());
s.pop();
while(!s.empty())
{
printf("+%d",s.top() );
s.pop();
}
printf("\n");
return ;
}
int res = 0;
for(int i = len + 1; i < n; i++)
{
pre[i] = len;//记录前一个数是多少
if(i != len+1 && m[i-1] == m[i]) //如果两个数相同就不加了 emmmmm意思就是防止出现重复的 比如有两个1. 2 1 1 2+1=3,2+1=3..
continue;
dfs(sum+m[i],i);
}
return;
}
int main()
{
while(~scanf("%d%d",&Sum,&n))
{
flag = 1;
if(Sum==0&&n==0)
break;
memset(pre,-1,sizeof pre);
for(int i = 0; i < n; i++)
scanf("%d",&m[i]);
printf("Sums of %d:\n",Sum);
dfs(0,-1);
if(flag)
printf("NONE\n");
}
}