Need help with a problem.

Правка en1, от Bojack_human, 2020-08-09 05:33:47

Given an array consisting of integers and a number K. K<=10^9. How to get the number of subsequences that has a sum greater or equal to K. The array size can at most be 36.

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en1 Английский Bojack_human 2020-08-09 05:33:47 199 Initial revision (published)