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
Codeforces Round 940 (Div. 2) and CodeCraft-23
43:34:21
Register now »

*has extra registration

→ Top rated

#	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

Countries | Cities | Organizations

→ Top contributors

#	User	Contrib.
1	maomao90	174
2	awoo	164
2	adamant	164
4	TheScrasse	159
4	nor	159
6	maroonrk	156
7	-is-this-fft-	150
8	SecondThread	147
9	orz	146
10	pajenegod	145

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)