ID | NAME | QUALITY | USERS | ACC % | DIFFICULTY C I |
---|---|---|---|---|---|
27220 | FOODIE | 13 | 463 |
|
|
15259 | Large Knapsack | 46 | 2259 |
|
|
3964 | Investment Money | 15 | 619 |
|
|
10798 | Wachovia Bank | 58 | 3863 |
|
#knapsack
The knapsack problem (rucksack problem) is a problem in combinatorial optimization. It derives its name from the problem faced by someone who is constrained by a fixed-size knapsack and must fill it with the most valuable items.