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
Refact.ai Match 1 (Codeforces Round 985)
4 days
Register now »

*has extra registration

→ Top rated

#	User	Rating
1	tourist	4009
2	jiangly	3831
3	Radewoosh	3646
4	jqdai0815	3620
4	Benq	3620
6	orzdevinwang	3529
7	ecnerwala	3446
8	Um_nik	3396
9	gamegame	3386
10	ksun48	3373

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	awoo	157
7	adamant	156
8	TheScrasse	154
8	nor	154
10	Dominater069	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 en1, by xuanquang1999, 2016-08-16 15:48:48

Is there a way to do this?

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)