一个简化的背包问题：一个背包能装总重量为 T，现有 n 个物件，其重量分别为（W1、W2、…、Wn）。问能否从这 n 个物件中挑选若干个物件放入背包中，使其总重量正好为 T ？若有解则给出全部解，否则输出无解。-A simplified knapsack problem: a backpack can hold a total weight for the T, the existing n-object, its weight, respectively (W1, W2, ..., Wn). Asked whether the objects from the n number of objects selected Add backpack to the total weight of an opportunity for T? If so, what solution is given the full solution, otherwise no solution output.