Sum It Up HOJ1258

Sum It Up

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

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

 

若有数组为{a,b,c,d,e,f,g} 则从左向右的顺序另若干个数加起来，使得和的结果为一个给定的sum。则可利用递归的思想，将数组分为两个部分，其中程序刚开始运行时，第一部分为{}，第二部分为{a,b,c,d,e,f,g}。然后利用for循环，另第二部分中的某个数和0相加，结果作为和。此时之前的第一部分和第二部分都被更新。

#include<cstdio>
#include<algorithm>
using namespace std;
int SUM,number,list[12];
int vis[12];
int a[13];
bool Flag;
bool comp(const int &a,const int &b) {
	return a>b;
}
void init() {
	Flag=false;
}
void dfs(int sum,int start,int cur) { //be_cur  begin_cursor    ac_cur  active_cursor
	if(sum>SUM) return;
	if(sum==SUM) {
		Flag=true;
		printf("%d",a[0]);
		for(int i=1; i<cur; i++) {
			printf("+%d",a[i]);
		}
		printf("\n");
		return;
	}
	for(int i=start; i<number; i++) {//从第二部分进行选择某一个元素
		a[cur]=list[i];
		dfs(sum+list[i],i+1,cur+1);//一旦进入内部，则第一部分被更新为sum+list[i],第二部分的开始的下标为i+1
		while(i+1<number&&list[i]==list[i+1])//搜索完毕后，若下一个搜索的数仍与当前相同，则跳过直至不相同
			i++;
	}
}
int main() {
	freopen("in.txt","r",stdin);
	while(scanf("%d%d",&SUM,&number) && SUM!=0 && number!=0) {
		for(int i=0; i<number; i++) scanf("%d",&list[i]);
		sort(list,list+number,comp);
		printf("Sums of %d:\n",SUM);
		init();
		dfs(0,0,0);
		if(Flag==0) {
			printf("NONE\n");
		}
	}
	return 0;
}