Bojack_human's blog

Need help with a problem.
By Bojack_human, history, 4 years ago, In English

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.

  • Vote: I like it
  • +1
  • Vote: I do not like it

»
4 years ago, # |
← Rev. 3   Vote: I like it 0 Vote: I do not like it

Do you know anything about Meet-in-The-Middle technique?! By Meet-in-The-Middle you can do it in O(2 ^ (36 / 2))

→ Reply
»
4 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Can you provide the link of the problem?

→ Reply