Minimum subset size for target sum.

Правка en1, от v0rtex, 2021-10-21 12:00:36

An array of size N is given and a value K. You have to find the minimum subset size so that subset sum is exactly equal to K, if not print -1. 0 < K, a[i], N < 10^6.

Теги subset sum, 0/1 knapsack, minimum

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en1 Английский v0rtex 2021-10-21 12:00:36 200 Initial revision (published)