Description: Suppose there a load of the backpack of the total volume of T and n volumes were w1, w2, ... wn items, whether selected from n items a number of exactly filled backpack, even if w1+ w2+ ...+wn = T, find out the solution of all the above conditions are met. For example: when T = 10, the volume of items {1,8,4,3,5,2}, can be found in the following solution:
(1,4,3,2)
(1,4,5)
(8,2)
(3,5,2).
To Search:
File list (Check if you may need any files):
背包问题求解.cpp
Download