Binomial coefficients of large numbers modulo prime

Правка en1, от Eddagdeg, 2019-02-12 12:28:46

Hello coders! let's suppose we have three numbers n,k,mod=1e9+7 where n,k<=1e9 how to calculate nCk %mod! any hint please! Thanks^__^

Теги #combinatorics, #math

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en1 Английский Eddagdeg 2019-02-12 12:28:46 187 Initial revision (published)