The number of combinations of n distinct items taken m at a time is given by the binomial coefficient
that does an array look-up after first allocating and computing entries in the array.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.