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
Hello 2025
4 days

→ Top rated

#	User	Rating
1	tourist	3985
2	jiangly	3885
3	jqdai0815	3682
4	Benq	3580
5	orzdevinwang	3526
6	ksun48	3506
7	ecnerwala	3505
8	Radewoosh	3457
9	Kevin114514	3377
10	gamegame	3374

Countries | Cities | Organizations

→ Top contributors

#	User	Contrib.
1	cry	170
2	Um_nik	162
3	atcoder_official	161
4	maomao90	158
4	-is-this-fft-	158
6	djm03178	157
7	Dominater069	156
8	adamant	154
9	luogu_official	153
10	awoo	152

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)