Knapsack Problem
本任务献给著名的经典Knapsack Problem 。
给您一个 物品种类列表 items ，您想把这些物品放进背包。每种物品都是一个包含其价值、重量和最大数量（可选）的元组。您需要找到一个物品子集，使得.....：
- 子集中物品的总价值尽可能大；
- 子集中物品的总重量最多为weight ，也就是折叠包的容量；
- 对于每种物品，你最多只能选择给定数量的物品。如果没有给定，则对数量没有限制。
CheckiO Extensions allow you to use local files to solve missions. More info in a blog post.
In order to install CheckiO client you'll need installed Python (version at least 3.8)
Install CheckiO Client first:
pip3 install checkio_client
Configure your tool
checkio --domain=py config --key=
Sync solutions into your local folder
checkio sync
(in beta testing) Launch local server so your browser can use it and sync solution between local file end extension on the fly. (doesn't work for safari)
checkio serv -d
Alternatevly, you can install Chrome extension or FF addon
checkio install-plugin
checkio install-plugin --ff
checkio install-plugin --chromium
Read more here about other functionality that the checkio client provides. Feel free to submit an issue in case of any difficulties.
Welcome to Pair Programming! Engage in real-time collaboration on coding projects by starting a session and sharing the provided unique URL with friends or colleagues. This feature is perfect for joint project development, debugging, or learning new skills together. Simply click 'Start Session' to begin your collaborative coding journey!
You are trying to join a pair programming session that has not started yet.
Please wait for the session creator to join.
It looks like the creator of the pair programming session closed the editor window.
It might happen accidentally, so that you can wait for reconnection.
