Introduction - If you have any usage issues, please Google them yourself
Suppose there is a load of T of the total weight of W1, N, W2, W3, Wn. Algorithm is compiled n items selected several pieces just loaded backpack, even if Wi1+Wi2+...+Win=T. (W beside the characters are all subscript). All solutions are required to meet the requirements.