Description: Description: 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
To Search:
- [sumofsub] - subset of several problems that back Met
- [subsum] - The back track method to solve the sub s
- [Subsetproblem] - And problems of a subset of an instance
File list (Check if you may need any files):
subSetSum
.........\Debug
.........\main.cpp
.........\subSetSum.ncb
.........\subSetSum.sln
.........\subSetSum.vcproj