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$,. Print the answer in modulo $10^9+7$. How to solve this problem in polynomial time?
# | User | Rating |
---|---|---|
1 | jiangly | 3640 |
2 | Benq | 3593 |
3 | tourist | 3572 |
4 | orzdevinwang | 3561 |
5 | cnnfls_csy | 3539 |
6 | ecnerwala | 3534 |
7 | Radewoosh | 3532 |
8 | gyh20 | 3447 |
9 | Rebelz | 3409 |
10 | Geothermal | 3408 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 173 |
2 | adamant | 164 |
3 | awoo | 161 |
4 | TheScrasse | 160 |
5 | nor | 159 |
6 | maroonrk | 156 |
7 | SecondThread | 152 |
8 | pajenegod | 146 |
9 | BledDest | 144 |
10 | Um_nik | 143 |
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 |
---|