1. 预处理:
#include<cstdio>
const int N = 2000 + 5;
const int MOD = (int)1e9 + 7;
int comb[N][N];//comb[n][m]就是C(n,m)
void init(){
for(int i = 0; i < N; i ++){
comb[i][0] = comb[i][i] = 1;
for(int j = 1; j < i; j ++){
comb[i][j] = comb[i-1][j] + comb[i-1][j-1];
comb[i][j] %= MOD;
}
}
}
int main(){
init();
}
2. 当c[MAX][MAX]开不下的时候用,也是预处理:
#include<cstdio>
const int N = 200000 + 5;
const int MOD = (int)1e9 + 7;
int F[N], Finv[N], inv[N];//F是阶乘,Finv是逆元的阶乘
void init(){
inv[1] = 1;
for(int i = 2; i < N; i ++){
inv[i] = (MOD - MOD / i) * 1ll * inv[MOD % i] % MOD;
}
F[0] = Finv[0] = 1;
for(int i = 1; i < N; i ++){
F[i] = F[i-1] * 1ll * i % MOD;
Finv[i] = Finv[i-1] * 1ll * inv[i] % MOD;
}
}
int comb(int n, int m){//comb(n, m)就是C(n, m)
if(m < 0 || m > n) return 0;
return F[n] * 1ll * Finv[n - m] % MOD * Finv[m] % MOD;
}
int main(){
init();
}
3. 采用分解质因子的方式,可以计算足够大的数(因为数字会超过long long的范围,所以结果依然用质因子表示,模板中计算出了相应的数)(#include <map>)
map <int, LL> m;
//分解质因数
//k为1或-1
void fun(int n, int k)
{
for (int i = 2; i <= sqrt(n * 1.0); i++)
{
while (n % i == 0)
{
n /= i;
m[i] += k;
}
}
if (n > 1)
{
m[n] += k;
}
}
//大数快速幂取模
LL quick_pow(LL a, LL b)
{
LL ret = 1;
while (b)
{
if (b & 1)
{
ret *= a;
ret %= MOD;
}
b >>= 1;
a *= a;
a %= MOD;
}
return ret;
}
//求组合数
LL C(LL a, LL b)
{
if (a < b || a < 0 || b < 0)
return 0;
m.clear();
LL ret = 1;
b = min(a - b, b);
for (int i = 0; i < b; i++)
{
fun(a - i, 1);
}
for (int i = b; i >= 1; i--)
{
fun(i, -1);
}
///以下计算出了具体的数
for (__typeof(m.begin()) it = m.begin(); it != m.end(); it++)
{
if ((*it).second != 0)
{
ret *= quick_pow((*it).first, (*it).second);
ret %= MOD;
}
}
return ret;
}