HDU1258 Sum It Up 【DFS】+【判重】
来源:互联网 发布:电脑重装数据恢复 编辑:程序博客网 时间:2024/05/23 05:08
Sum It Up
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 3944 Accepted Submission(s): 2026
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 <stdio.h>int arr[12], vis[12];int t, n, ok;void PRINT(int id){for(int i = 0; i < id; ++i)if(i != id - 1) printf("%d+", vis[i]);else printf("%d\n", vis[i]);ok = 1;}void DFS(int index, int id, int sum){if(sum >= t){if(sum == t) PRINT(id);return;}for(int j = index; j < n; ++j){if(j == index || arr[j] != arr[j-1]){vis[id] = arr[j];DFS(j+1, id+1, sum+arr[j]);}}}int main(){while(scanf("%d%d", &t, &n), n){for(int i = 0; i < n; ++i)scanf("%d", arr + i);printf("Sums of %d:\n", t);ok = 0; DFS(0, 0, 0);if(!ok) printf("NONE\n");}return 0;}
0 0
- HDU1258 Sum It Up 【DFS】+【判重】
- HDU1258:Sum It Up(DFS)
- hdu1258 Sum It Up (DFS)
- Sum It Up(hdu1258,dfs)
- HDU1258:Sum It Up(DFS)
- HDU1258:Sum It Up(DFS)
- DFS hdu1258 Sum It Up
- HDU1258 Sum It Up(DFS)
- HDU1258 POJ1564 Sum It Up DFS
- hdu1258 Sum It Up(dfs)
- HDU1258 Sum It Up(DFS)
- HDU1258 Sum It Up (DFS)
- HDU1258 Sum It Up
- HDU1258:Sum It Up
- Sum It Up hdu1258
- HDU1258 Sum it up
- HDU1258 Sum It Up
- hdu1258(Sum It Up)
- Codeforces Round #259 (Div. 2) C Little Pony and Expected Maximum
- 自定义类的copy实现(实现NSCopying协议)
- 铺尔铺客户端打包失败Failed to export application 之完美解决办法。
- Java Web知识
- J2EE相关技术
- HDU1258 Sum It Up 【DFS】+【判重】
- HDU 2833 WuKong(floyd最短路)
- 【黑马程序员】Java基础学习博客——数组
- 输入一个字节内的数(0~255)和移动位数。输出移位结果(要求循环移位)
- HDU_4535 吉哥系列故事——礼尚往来
- nyoj289苹果
- Matlab------ODE的使用
- hdoj2048 神、上帝以及老天爷
- Nginx 补充