说明:子集和问题

给定一个n个整数的集合X = {x1, x2, …, xn}和整数Y，找出和等于Y的X的子集subX。

比如说，如果X ={10,20,30,40,50,60} 和 Y = 60

则有三种不同长度的解，它们分别是

subY = {10，20，30}，{20，40} 和{60}

使用回溯法实现.开发VS2005工具-Descr iption: a subset of the problem and given a set of n integers X = (x1, x2, ..., xn) and an integer Y, find the X and Y equal to a subset of subX. For example, if X = (10,20,30,40,50,60) and Y = 60 there are three different length of the solution, they are subY = (10,20,30), (20,40) and (60) use of retrospective method. development tool VS2005