超速求阶乘逆元
ll fact[N + 1], infact[N + 1];
void x_x()
{
fact[0] = infact[0] = 1;
f(i,1,N)fact[i] = fact[i - 1] * i%mod;
infact[N] = inv(fact[N], mod);//倒着求,只需要求一次exgcd
ff(i,N-1,1)infact[i] = infact[i + 1] * (i + 1) % mod;
}
1.N是2000时,可以用递推公式c[a][b]=c[a-1][b-1]+c[a-1][b]打表
int c[2005][2005];
void x_x()
{
c[0][0]=1;
f(i, 1, 2001)
{
f(j, 0, i)
{
if (!j)c[i][j] = 1;
else c[i][j] = (c[i - 1][j - 1] + c[i - 1][j]) % mod;
}
}
}
2.N是2e5级别是,可以预处理出2e5范围内的阶乘和题目所给模数意义下的逆元。然后用公式c(a,b)=a!/(b!*(a-b)!)
ll fac[N], ifac[N];
void x_x()
{
fac[0] = ifac[0] = 1;
f(i, 1, 2e5+5)
{
fac[i] = fac[i - 1] * i%mod;
ifac[i] = ifac[i-1] * inv(i, mod) % mod;
}
}
3.当N是1e18级别,而模数是2e5级别时,使用卢卡斯定理。
ll lucas(ll a, ll b)
{
if (a < m&&b < m) return (fac[a] * ifac[b] % m*ifac[a - b] % m);
ll aa = a % m, bb = b % m;
return (fac[aa] * ifac[bb] % m*ifac[aa - bb] % m)*lucas(a / m, b / m) % m;
}
4.当要求高精度计算时,可算出对于c(a,b)=a!/(b!*(a-b)!)中,每个因子在各阶乘中的出现次数,然后抵消相加。。然后就是一个高精度乘法问题
int primes[N], cnt,book[N];
int n;
int sum[N];//存相除后质因子次数
void get_prime(int n)
{
f(i, 2, n)
{
if (!book[i])primes[cnt++] = i;
for (int j = 0;primes[j] <= n / i;++j)
{
book[primes[j] * i] = 1;
if (i%primes[j] == 0)break;
}
}
}
int get(int n, int p)//n中某个质因子的次数
{
int ans = 0;
while (n)
{
ans += n / p;
n /= p;
}
return ans;
}
vector<int> mul(vector<int> a, int b)
{
vector<int> c;
int t = 0;
for (int i = 0; i < a.size(); ++i)
{
t += a[i] * b;
c.push_back(t % 10);
t /= 10;
}
while (t)
{
c.push_back(t % 10);
t /= 10;
}
return c;
}
int main()
{
int a, b;
cin >> a >> b;
get_prime(a);
for (int i = 0;i < cnt;++i)
{
int j = primes[i];
sum[i] = get(a, j) - get(b, j) - get(a - b, j);
}
vector<int> res;
res.emplace_back(1);
f(i, 0, cnt - 1)
{
f(j, 0, sum[i] - 1)
res = mul(res, primes[i]);
}
ff(i, res.size() - 1, 0)
printf("%d", res[i]);
puts("");
return 0;
}