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

subSetSum
.........\Debug
.........\main.cpp
.........\subSetSum.ncb
.........\subSetSum.sln
.........\subSetSum.vcproj

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．