题目 | Monocarp and the Set
Educational Codeforces Round 156 (Rated for Div. 2)
D. Monocarp and the Set
Educational Codeforces Round 156 (Rated for Div. 2)
D. Monocarp and the Set
Educational Codeforces Round 138 (Rated for Div. 2)
D. Counting Arrays
组合数:从 $n$ 个不同元素中取出 $k$ 个元素的所有不同组合的个数,叫做从 $n$ 个不同元素中取出 $k$ 个元素的组合数,记作 $C_n^k$。