一般有两种方法
费马小定理
ll fac[maxn];
ll qpow(ll x, ll y){
ll res = 1;
while(y){
if(y & 1) res = (res * x) % mod;
y >>= 1;
x = (x * x) % mod;
}
return res;
}
void init(){//记得放到主函数里面
fac[0] = 1;
for(int i = 1; i < maxn; i++){
fac[i] = fac[i-1] * i % mod;
}
}
ll Com(ll n,ll m){
if(m > n || m < 0) return 0;
ll a = fac[n], b = fac[n-m] * fac[m] % mod;
return a * qpow(b, mod - 2) % mod;
}
打表
ll C[maxn][maxn];
void init(){
rep(i, 0, 5000){
rep(j, 0, i){
C[i][j] = 1;
}
}
rep(i, 2, 5000){
rep(j, 1, i){
C[i][j] = (C[i-1][j] + C[i-1][j-1]) % mod;
}
}
}