Sign in
or
Register
Courses
Textbook
Compiler
Contests
Topics
Courses
Dynamic programming
Module:
The backpack problem
№
List of Problems
Mark of completion
1
0-1 backpack: highest weight
2
0-1 backpack: minimum items
3
Knapsack problem with answer recovery
4
Money box
5
Weights
6
Surrender - 1