Is there a way to do this if m, k <= 10^9?
PS: C here mean combination number.
Calculating (C(k, k) + C(k+1, k) + C(k+2, k) + ... + C(m, k)) modulo 1234567890 (m >= k) in 1 second?
Is there a way to do this if m, k <= 10^9?
PS: C here mean combination number.
Rev. | Lang. | By | When | Δ | Comment | |
---|---|---|---|---|---|---|
en2 | xuanquang1999 | 2016-08-16 15:52:00 | 55 | Tiny change: 'to do this?' -> 'to do this if m, k <= 10^9?\n\nPS: C here mean combination number.' | ||
en1 | xuanquang1999 | 2016-08-16 15:48:48 | 127 | Initial revision (published) |