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.
# | User | Rating |
---|---|---|
1 | tourist | 3757 |
2 | jiangly | 3647 |
3 | Benq | 3581 |
4 | orzdevinwang | 3570 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | Radewoosh | 3509 |
8 | ecnerwala | 3486 |
9 | jqdai0815 | 3474 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 171 |
2 | awoo | 165 |
3 | adamant | 164 |
4 | TheScrasse | 159 |
5 | maroonrk | 154 |
5 | nor | 154 |
7 | -is-this-fft- | 152 |
8 | Petr | 147 |
9 | orz | 146 |
10 | pajenegod | 145 |
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.
Name |
---|
Do you know anything about Meet-in-The-Middle technique?! By Meet-in-The-Middle you can do it in O(2 ^ (36 / 2))
thanks man.
Can you provide the link of the problem?
https://toph.co/arena?contest=intra-sust-2020-preliminary-1#!/p/5f2c4fcb6f470700012c370e