hdu 1258 Sum It Up
来源:互联网 发布:有趣的c语言表白程序 编辑:程序博客网 时间:2024/05/22 00:37
Sum It Up
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5575 Accepted Submission(s): 2911
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
Source
浙江工业大学第四届大学生程序设计竞赛
Recommend
JGShining | We have carefully selected several similar problems for you: 1010 1241 1181 1175 1045
#include<stdio.h>#include<string.h>#include<algorithm>using namespace std;int m,a[10100],flag,j;int res[10100]={10000};int vis[10100];void dfs(int t,int cnt){int i; if(t==0) { flag=1; for(j=1;j<cnt-1;j++) printf("%d+",res[j]); printf("%d\n",res[j]); return ;}for(i=1;i<=m;i++){if(!vis[i]&&t-a[i]>=0&&a[i]<=res[cnt-1]){vis[i]=1;//对用过的数进行标记 res[cnt]=a[i];//dfs是先确定第一个数,再确定第二个,一直往后 dfs(t-a[i],cnt+1);vis[i]=0;while(a[i]==a[i+1]&&i<=m)//如果给的数字重复,跳到下一个 ++i;}}}int main(){int i,t;while(scanf("%d%d",&t,&m),t+m){for(i=1;i<=m;i++)scanf("%d",&a[i]);//真不知道自己写代码时在想什么,竟然忘写&,这就是教训啊!!! flag=0;printf("Sums of %d:\n",t);memset(vis,0,sizeof(vis));dfs(t,1);if(!flag)printf("NONE\n");}}
0 0
- hdu 1258 Sum It Up
- HDU 1258 sum it up
- HDU-1258-Sum It Up
- HDU 1258 Sum It Up
- hdu 1258 sum it up
- HDU 1258 - Sum It Up
- hdu 1258 Sum It Up
- hdu 1258 Sum It Up
- hdu 1258 Sum It Up
- (hdu) 1258 Sum It Up
- HDU 1258 Sum It Up
- HDU 1258:Sum It Up
- hdu-1258 Sum It Up
- hdu 1258 Sum It Up
- HDU 1258 Sum It Up
- HDU 1258 Sum It Up
- hdu 1258 Sum It Up
- hdu 1258 Sum It Up
- ios开发——解决UICollectionView的cell间距与设置不符问题
- CDR和DMG以及PKG的格式的区别
- LeetCode 42 - Trapping Rain Water
- 初识gdbserver
- BIEE XML文件
- hdu 1258 Sum It Up
- ios获取当前的时间
- 高等数学:第十一章 无穷级数(1)常数项技术的概念、性质、审敛法、幂级数
- C语言数组与指针(四)
- u盘在我的电脑中不显示
- 图像因其本身有错无法显示 解决方法
- 在liunx系统安装一些rpm软件包
- Markdown语法介绍
- 算法代码实现之选出第k小元素、中位数、最小的k个元素(线性复杂度),C/C++实现