文件名称:zijiheshuwenti
-
所属分类:
- 标签属性:
- 上传时间:2013-10-10
-
文件大小:8.95kb
-
已下载:0次
-
提 供 者:
-
相关连接:无下载说明:别用迅雷下载,失败请重下,重下不扣分!
介绍说明--下载内容来自于网络,使用问题请自行百度
1、问题陈述
给定N个数,和一个数T,判定是否可以从N个数中取出若干个数,使它们的和等于T。输出:YES或者NO。把N个数看成一个集合,问题就是从这个集合中选出一个子集,使这个子集满足和是T
2、问题分析:
枚举+剪枝。
-1, the problem statement given number N, and a number T, determining whether the number N is removed from certain numbers, so that their sum is equal to T. Output: YES or NO. The number N as a set, the question is chosen from the set a subset, so that this subset is satisfied and T 2, problem analysis: Enumeration+ pruning.
给定N个数,和一个数T,判定是否可以从N个数中取出若干个数,使它们的和等于T。输出:YES或者NO。把N个数看成一个集合,问题就是从这个集合中选出一个子集,使这个子集满足和是T
2、问题分析:
枚举+剪枝。
-1, the problem statement given number N, and a number T, determining whether the number N is removed from certain numbers, so that their sum is equal to T. Output: YES or NO. The number N as a set, the question is chosen from the set a subset, so that this subset is satisfied and T 2, problem analysis: Enumeration+ pruning.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
子集和数问题.doc
本网站为编程资源及源代码搜集、介绍的搜索网站,版权归原作者所有! 粤ICP备11031372号
1999-2046 搜珍网 All Rights Reserved.