given N objects, each one with M copies, how many ways are there to choose exactly K from them? - Codeforces

→ Pay attention

Before contest
CodeTON Round 9 (Div. 1 + Div. 2, Rated, Prizes!)
17:33:41
Register now »

*has extra registration

→ Streams

Leetcode BiWeekly Contest 144 — Solution Discussion

By Shayan

Before stream 19:03:40

Codeforces CodeTON Round 9 (Div 1 + Div 2) — Solution Discussion

By Shayan

Before stream 20:33:40

View all →

→ 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	167
2	Um_nik	163
3	maomao90	162
3	atcoder_official	162
5	adamant	159
6	-is-this-fft-	158
7	awoo	157
8	TheScrasse	154
9	Dominater069	153
9	nor	153

View all →

→ Find user

→ Recent actions

Detailed →

given N objects, each one with M copies, how many ways are there to choose exactly K from them?

Revision en2, by pabloskimg, 2019-06-07 07:31:41

Pretty much the title. Source: https://open.kattis.com/problems/classicalcounting

Tags

#combinatorics, #math

History

Revisions

	Rev.	Lang.	By	When	Δ	Comment
	en2		pabloskimg	2019-06-07 07:31:41	26
	en1		pabloskimg	2019-06-07 06:42:06	150	Initial revision (published)