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?
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) |