1、逆元线性筛
const int mod = 1e; const int maxn = 10005; int inv[maxn]; inv[1] = 1; for(int i = 2; i < 10000; i++) inv[i] = inv[mod % i] * (mod - mod / i) % mod;
2、阶乘逆元线性筛
inv[N]=qpow(fac[N],mod-2); for(ll i=N-1;i>=0;i--) inv[i]=(inv[i+1]*(i+1))%mod;
1、逆元线性筛
const int mod = 1e; const int maxn = 10005; int inv[maxn]; inv[1] = 1; for(int i = 2; i < 10000; i++) inv[i] = inv[mod % i] * (mod - mod / i) % mod;
2、阶乘逆元线性筛
inv[N]=qpow(fac[N],mod-2); for(ll i=N-1;i>=0;i--) inv[i]=(inv[i+1]*(i+1))%mod;