blob: ada06e6e2484ef5bd76dc3fff92acc8ff24cfb87 (
plain)
1
2
3
4
5
6
7
8
9
|
def nCr_mod_p(n, r, p):
if (r > n- r):
r = n - r
C = [0 for i in range(r + 1)]
C[0] = 1
for i in range(1, n + 1):
for j in range(min(i, r), 0, -1):
C[j] = (C[j] + C[j-1]) % p
return C[r]
|