Knapsack Problem
This mission is dedicated to a famous and classical Knapsack Problem.
You are given a list of kinds of items items, that you want to put into knapsack. Item of each kind is a tuple of its value, weight and maximum amount (optional). You need to find a subset of items, such that:
- the total value of the items in subset is as large as possible;
- the total weight of items in subset is at most weight, that is capacity of the knapsack;
- for...
You should be an authorized user in order to see the full description and start solving this mission.