对于 n,m <= 1e8
直接递推求 1 ~ 1e8的阶乘 frac[ i ]
求出对应的逆元 carf[ i ]
C( n,m ) = frac[ n ] * carf[ n-m ]*carf[ m ]
typedef unsigned long long ll;
#define maxn 1002000
const ll oo=1000003;
ll frac[maxn], carf[maxn];
ll inv(ll x){
if (x==1) return 1;
else return (oo-oo/x)*inv(oo%x)%oo;
}
void init(){
frac[0]=1;
for (int i=1;i<=1000000;i++)
frac[i]=frac[i-1]*i%oo;
carf[1000000]=inv(frac[1000000]);
for (int i=1000000;i>=1;i--)
carf[i-1]=carf[i]*i%oo;
}
ll C(int n, int m){
if (m>n) return 0;
else return frac[n]*carf[n-m]%oo*carf[m]%oo;
}
对于 n,m > 1e8
Lucas 定理
ll lucas(ll n,ll m){
if (m==0) return 1;
if (m>n) return 0;
return C(n%oo,m%oo)*lucas(n/oo,m/oo)%oo;
}