题目描述: 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…

题目链接: http://poj.org/problem?id=1564 题目: Sum It Up Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 5839   Accepted: 2984 Description Given a specified total t and a list of n integers, find all distinct sums using numbers from the list t…

#include"cstring" #include"cstdio" +; int nux[maxn]; int nua[maxn];//解的集合 int t;//t为和 int n;//n为元素个数 bool flag;//判断是否有解 void dfs(int sum,int cur,int k){//sum剩余的大小 k为下标,cur为元素个数 ){ flag=false;//证明有解 ;i<cur;i++) ) printf("%d"…

dfs判重 #include<stdio.h> #include<iostream> #include<cstdio> #include<queue> #include<queue> #include<stack> #include<cmath> #include<cstring> #include<cstdlib> #include<climits> #include<algor…

POJhttp://poj.org/problem?id=1564 ZOJhttp://acm.zju.edu.cn/onlinejudge/showProblem.do?problemId=711 HDUhttp://acm.hdu.edu.cn/showproblem.php?pid=1258 今天不好玩.学校网断了,wifi也用不了,爪机当热点还上不去!!!A一题容易吗!然后鼠标更不好使了,果断去买了一个. 瞬间又成穷人.T T 换了个鼠标心情大好~ -------------------…

C - Sum It Up POJ1564 题意: 给你一个N,然后给你一堆数The numbers in each list appear in nonincreasing order, and there may be repetitions.,让你在这对数里找出一些数,如果他们的和sum==N,则按样例的格式数输出. 思路: 那就是DFS呗,深搜一波,当sum==N时就输出,这里有一个就是排除重复的剪枝.为什么呢? #include<iostream> #include<cstdi…