LL fac[N];
void init()
{
int i;
fac[0] =1;
for(i =1; i <= p; i++)
fac[i] = fac[i-1]*i%p;
}
LL pow(LL a, LL b)
{
LL tmp = a % p, ans =1;
while(b)
{
if(b &1) ans = ans * tmp % p;
tmp = tmp*tmp % p;
b >>=1;
}
return ans;
}
LL C(LL n, LL m)
{
if(m>n)return 0;
return fac[n]*pow(fac[m]*fac[n-m],p-2)%p;
}
LL cfun(LL n, LL m)
{
if(m ==0) return 1;
else return (C(n%p,m%p)*cfun(n/p, m/p))%p;
}//求的为Cnm。
求大组合数取模的模板(lucas定理)
最新推荐文章于 2021-08-19 10:13:34 发布