Hello, there is a task: From an array of numbers, choose any number of elements that together will give a given number. At the same time, the same number cannot be used 2 times. I want to hear how you would solve this problem. One of the variations of the backpack problem, and apparently the task relates to NP.
- The backpack is, in its pure form. - VladD
- It seems to be a classic backpack problem easier, because there you can take the same item an unlimited number of times, I will be grateful for any link related to my problem. - Kolowin
|