Is there a way to do this if m, k <= 10^9?
PS: C here mean combination number.
→ Pay attention
→ Streams
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3676 |
| 2 | Kevin114514 | 3659 |
| 3 | jiangly | 3640 |
| 4 | turmax | 3450 |
| 5 | tourist | 3382 |
| 6 | strapple | 3360 |
| 7 | Um_nik | 3354 |
| 8 | squareOf105 | 3348 |
| 9 | maroonrk | 3312 |
| 10 | idontwannadothis…e | 3191 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 155 |
| 2 | nik_exists | 151 |
| 3 | maspy | 149 |
| 4 | AmShZ | 145 |
| 5 | Um_nik | 143 |
| 6 | Errichto | 139 |
| 7 | BledDest | 136 |
| 8 | adamant | 134 |
| 9 | maroonrk | 132 |
| 10 | cry | 130 |
→ Find user
→ Recent actions
Calculating (C(k, k) + C(k+1, k) + C(k+2, k) + ... + C(m, k)) modulo 1234567890 (m >= k) in 1 second?
Revision en2, by xuanquang1999, 2016-08-16 15:52:00
History
Revisions
| 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) |
Codeforces (c) Copyright 2010-2026 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Nov/07/2026 20:26:09 (g2).
Desktop version, switch to mobile version.
Supported by
