Calculating (C(k, k) + C(k+1, k) + C(k+2, k) + ... + C(m, k)) modulo 1234567890 (m >= k) in 1 second? - Codeforces

→ Pay attention

Before contest
2024-2025 ICPC, NERC, Southern and Volga Russian Regional Contest (Unrated, Online Mirror, ICPC Rules, Preferably Teams)
32:54:11
Register now »

→ Top rated

#	User	Rating
1	tourist	4009
2	jiangly	3823
3	Benq	3738
4	Radewoosh	3633
5	jqdai0815	3620
6	orzdevinwang	3529
7	ecnerwala	3446
8	Um_nik	3396
9	ksun48	3390
10	gamegame	3386

Countries | Cities | Organizations

→ Top contributors

#	User	Contrib.
1	cry	164
1	maomao90	164
3	Um_nik	163
4	atcoder_official	160
5	-is-this-fft-	158
6	adamant	157
6	awoo	157
8	TheScrasse	154
8	nor	154
10	djm03178	153

View all →

→ Find user

→ Recent actions

Detailed →

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

Is there a way to do this if m, k <= 10^9?

PS: C here mean combination number.

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)