Count Subsets Size K
Easy
Computer Mathematics
Combinatorics
22 views
Problem Statement
Given n and k, count k-sized subsets.
Input Format
Two integers n k.
Output Format
One integer.
Example
6 3
20
Constraints
0
Input / Output Format
Input Format
Two integers n k.
Output Format
One integer.
Constraints
0
Examples
Input:
6 3
Output:
20
Example Solution (Public)
This is C(n,k).
Official Solution Code
This is C(n,k).
Please login to submit solutions.