Soct

代码说明：

   假设有一个能装入总体积为T的背包和n件体积分别为w1 , w2 , … , wn 的物品，能否从n件物品中挑选若干件恰好装满背包，即使w1 +w2 + … + wn=T，要求找出所有满足上述条件的解。例如：当T=10，各件物品的体积{1，8，4，3，5，2}时，可找到下列4组解：（1，4，3，2），（1，4，5），（8，2），（3，5，2）。 [需求分析](Suppose there are 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 four solutions: (1,4,3,2), (1,4,5 ), (8,2), (3,5,2). [Needs Analysis])