Binomial Coefficient

Time limit2sMemory limit512 MB

Summary

Given n (up to 10^18) and k, compute the binomial coefficient C(n, k) modulo 2^32.

Problem

Given $n$ and $k$ , calculate $\binom{n}{k} = \frac{n!}{k!(n - k)!} \bmod (2^{32})$ .

Two integers $n$ and $k$ ( $1 \leq n \leq 10^{18}, 0 \leq k \leq n$ ).

A single integer, the value.