一、杨辉三角
for(int i=0;i<=n;i++)
{
c[i][0] = 1, c[i][i] = 1;
for(int k=1;k<i;k++)
{
c[i][k] = c[i-1][k] + c[i-1][k-1];
c[i][k] %= q;
}
}
for (int i=1; i<=n;i++ )
for (int j=0;j<=i;j++ )
if(!j)c[i][j]=1;
else c[i][j]=(c[i-1][j]+c[i-1][j-1])%mod;
二、快速幂求逆元
要求mod为质数
//快速幂
int qmi(int a, int k)
{
int res = 1;
while (k)
{
if (k & 1) res = (LL)res * a % mod;
a = (LL)a * a % mod;
k >>= 1;
}
return res;
}
int main()
{
//预处理
fact[0] = 1;
for (int i = 1; i < N; i ++ ) fact[i] = (LL)fact[i - 1] * i % mod;
//从u中取v个,这样的组合数即为:
c(u, v) = (fact[u] * qsm((fact[u-v] * fact[v]) % mod, mod - 2)) % mod;
}
//快速幂
int qmi(int a, int k, int p)
{
int res = 1;
while (k)
{
if (k & 1) res = (LL)res * a % p;
a = (LL)a * a % p;
k >>= 1;
}
return res;
}
int main()
{
//预处理
fact[0] = infact[0] = 1;
for (int i = 1; i < N; i ++ )
{
fact[i] = (LL)fact[i - 1] * i % mod;
infact[i] = (LL)infact[i - 1] * qmi(i, mod - 2, mod) % mod;
}
c(a,b) = (LL)fact[a] * infact[b] % mod * infact[a - b] % mod;
}