Problemcore
Bounded knapsack
Also called Bounded (multiple) knapsack.
Knapsack variant where each item type has a limited number of copies, solved by binary splitting or monotone queue dynamic programming.
Knapsack variant where each item type has a limited number of copies, solved by binary splitting or monotone queue dynamic programming.
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag XE00JC Edit this page History Report an error