Binomial Coefficient — Solution & Editorial

Back to the Problem

Precompute factorials mod p; C(n,k) = n! · (k!)⁻¹ · ((n−k)!)⁻¹ with Fermat inverses.

Complexity: O(N) precompute, O(log p) per query