0-1背包问题被称为NP完全问题。但是，如果每个项目的重量是相同的，问题是仍NP完全？

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?

推荐答案

没有，因为你永远只是采取任何项目是最有价值的。

No, because you always just take whatever items are the most valuable.