Is there a way to do this if m, k <= 10^9?
PS: C here mean combination number.
# | 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 | adamant | 164 |
2 | awoo | 164 |
4 | TheScrasse | 160 |
5 | nor | 159 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 150 |
8 | SecondThread | 147 |
9 | orz | 146 |
10 | pajenegod | 145 |
Is there a way to do this if m, k <= 10^9?
PS: C here mean combination number.
Name |
---|
Auto comment: topic has been updated by xuanquang1999 (previous revision, new revision, compare).
Recall that C(K, K) + C(K + 1, K) + .. + C(M, K) = C(M + 1, K + 1)
Since your modulo is not a prime, you're probably looking to do something like this to compute it.