Description: Subset of the problem and an example for < S, t> . Of which, S = (x1, x2, ..., xn) is a set of positive integers, c is a positive integer. And problems in a subset of S to determine whether there is a subset of S1, makes x1+ x2+...+ xk = S, one x1, x2 ... xk are set S1. For a given set of positive integers S and positive integer c, calculated S a subset of S1, makes x1+ x2+...+ xk = S, one x1, x2 ... xk are set S1.
To Search:
- [subset] - The use of retrospective method and prob
- [LectureHalls] - acm algorithm design- the venue arrangem
- [WorkAssignment] - acm algorithm design with n pieces of wo
- [OilingCar] - acm algorithm design Description: Top up
- [game1] - Branch and bound algorithm operation: gr
- [03] - Subset of the problem and an example for
- [qichejiayou] - Fill up the car after driving an n km. T
File list (Check if you may need any files):
Subset Sum
..........\Debug
..........\.....\StdAfx.obj
..........\.....\Subset Sum.exe
..........\.....\Subset Sum.ilk
..........\.....\Subset Sum.obj
..........\.....\Subset Sum.pch
..........\.....\Subset Sum.pdb
..........\.....\vc60.idb
..........\.....\vc60.pdb
..........\ReadMe.txt
..........\StdAfx.cpp
..........\StdAfx.h
..........\Subset Sum.cpp
..........\Subset Sum.dsp
..........\Subset Sum.dsw
..........\Subset Sum.ncb
..........\Subset Sum.opt
..........\Subset Sum.plg
Download