文件名称:Subsets
介绍说明－－下载内容均来自于网络，请自行研究使用
数据输入：由文件input.txt提供输入的数据。文件第一行有2个正整数n和c，n表示S的大小，c是子集和的目标值。接下来的1行中，有n个正整数，表示集合S中的元素。
结果输出：将子集和问题的解输出到文件output.txt。当问题无解时，输出“No Solution”。(Data Entry: The input data provided by the file input.txt. The first line of the file has two positive integers n and c, where n is the size of S, and c is the target of subset sum. In the next line, there are n positive integers, which represent the elements in the set S.
Result Output: Output the subset and problem solutions to the file output.txt. When the problem is not solved, "No Solution" is output.)
结果输出：将子集和问题的解输出到文件output.txt。当问题无解时，输出“No Solution”。(Data Entry: The input data provided by the file input.txt. The first line of the file has two positive integers n and c, where n is the size of S, and c is the target of subset sum. In the next line, there are n positive integers, which represent the elements in the set S.
Result Output: Output the subset and problem solutions to the file output.txt. When the problem is not solved, "No Solution" is output.)
相关搜索： 回溯法和动态规划法解决子集和问题
(系统自动生成,下载前可以参看下载内容)
下载文件列表
| 文件名 | 大小 | 更新时间 |
|---|---|---|
| Subsets.txt | 2379 | 2018-02-07 |