问题
The 0-1 Knapsack problem is known as NP-complete. But if the weight for each item are the same, the problem is still NP-complete?
回答1:
No, because you always just take whatever items are the most valuable.
来源：https://stackoverflow.com/questions/11249448/is-the-0-1-knapsack-that-each-item-has-the-same-weight-np-complete