You're given $$$n$$$ integers $$$a_1,a_2,\dots,a_n$$$, you need to count the number of ways to choose some of them (no duplicate) to make the sum equal to $$$S$$$, in modulo $$$10^9+7$$$. How to solve this problem in polynomial time?
# | User | Rating |
---|---|---|
1 | ecnerwala | 3648 |
2 | Benq | 3580 |
3 | orzdevinwang | 3570 |
4 | cnnfls_csy | 3569 |
5 | Geothermal | 3568 |
6 | tourist | 3565 |
7 | maroonrk | 3530 |
8 | Radewoosh | 3520 |
9 | Um_nik | 3481 |
10 | jiangly | 3467 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 164 |
2 | adamant | 164 |
4 | TheScrasse | 159 |
4 | nor | 159 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 150 |
8 | SecondThread | 147 |
9 | orz | 146 |
10 | pajenegod | 145 |
A knapsack optimizing problem
You're given $$$n$$$ integers $$$a_1,a_2,\dots,a_n$$$, you need to count the number of ways to choose some of them (no duplicate) to make the sum equal to $$$S$$$, in modulo $$$10^9+7$$$. How to solve this problem in polynomial time?
Rev. | Lang. | By | When | Δ | Comment | |
---|---|---|---|---|---|---|
en3 | rlajkalspowq | 2020-04-01 06:00:51 | 197 | |||
en2 | rlajkalspowq | 2019-12-06 17:02:56 | 19 | Tiny change: 'ual to $S$, in modulo' -> 'ual to $S$. Print the answer in modulo' | ||
en1 | rlajkalspowq | 2019-12-06 17:01:08 | 246 | Initial revision (published) |
Name |
---|