Sum It Up
来源:互联网 发布:网络配置存在问题和dns 编辑:程序博客网 时间:2024/06/06 14:07
Sum It Up
Time Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)
Total Submission(s) : 6 Accepted Submission(s) : 5
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#include<iostream>using namespace std ;#define MAX 15int t , n ;int a[MAX] , flag , k , b[MAX];void DFS(int sum , int pos){ int i ; if(!sum) { cout<<b[0]; flag = 1 ; for( i = 1 ; i < k ; i++) cout<<"+"<<b[i] ; cout<<endl; return ; } if(pos >= n || sum < 0 ) return ; else for( i = pos ; i < n ;i ++) { if(i==pos || a[i] != a[i-1]) { b[k++] = a[i] ; DFS(sum - a[i] , i + 1 ); k -- ; } } return ;}int main(void){ while(cin >> t >> n && (t&&n)) { int i ; for( i = 0 ; i < n ; i ++ ) cin >> a[i] ; flag = 0 ; k = 0 ; cout<<"Sums of "<<t<<":"<<endl; DFS(t , 0); if(!flag) cout<<"NONE"<<endl; } return 0 ;}
- JOJ1197: Sum It Up
- Sum It Up
- Sum It Up
- Poj Sum It Up
- Sum It Up
- HDU1258 Sum It Up
- HDU1258:Sum It Up
- Sum It Up
- poj sum it up
- poj sum it up
- Sum It Up
- Sum It Up
- poj1564 Sum it up
- Sum It Up
- Sum it up
- zoj1711-Sum It Up
- Sum It Up hdu1258
- Sum It Up
- 细说PHP 学习笔记(一)
- Windows 8.1:Windows 8续集演绎[翻译]
- sql server 存储过程
- 写一个最简单的MBR程序
- BSP工程中bib文件介绍
- Sum It Up
- linux kernel中如何保证append写的原子性
- MySQL学习记录(常用函数+演示分析)六 DML
- Winform 显示远程图片
- S5PV210 Uart Driver
- 第五章 对象和面向对象
- SQL Server版语法
- UVa 10130 - SuperSale
- IE6 opacity半透明 BUG解决办法