组合数
以下求 C a b C_a^b Cab的情况
一( N 2 N^2 N2)
使用递推式
C
a
b
=
C
a
−
1
b
+
C
a
−
1
b
−
1
C_a^b=C_{a-1}^b+C_{a-1}^{b-1}
Cab=Ca−1b+Ca−1b−1求解
阶乘%1e9+7
T
=
1
0
5
T=10^5
T=105
1
≤
b
≤
a
≤
2000
1\leq b\leq a\leq 2000
1≤b≤a≤2000
#include<bits/stdc++.h>
using namespace std;
int c[2010][2010];
const int mod=1e9+7;
void init(){
for(int i=0;i<=2000;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;
}
int main(){
init();
int t;cin>>t;while(t--){
int a,b;
cin>>a>>b;
cout<<c[a][b]<<endl;
}
}
二( N ⋅ log 2 N N \cdot \log_2 N N⋅log2N)
T
=
1
0
5
T=10^5
T=105
1
≤
b
≤
a
≤
1
0
5
1\leq b\leq a\leq 10^5
1≤b≤a≤105
阶乘%1e9+7
使用公式
C
a
b
=
a
!
(
a
−
b
)
!
⋅
b
!
C_a^b=\frac {a!}{(a-b)! \cdot b!}
Cab=(a−b)!⋅b!a!
预处理阶乘,使用快速幂预处理阶乘的逆元
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int fact[100010],infact[100010];//fact 阶乘,infact 逆元的阶乘
const int mod = 1e9+7;
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;//0的阶乘
for(int i=1;i<=100000;i++){
fact[i] = (ll)fact[i-1] * i % mod;
infact[i] = (ll)infact[i-1] * qmi(i, mod-2, mod) % mod;
}
int t;cin>> t; while(t--){
int a,b;
cin>>a>>b;
cout<<(ll)fact[a] * infact[b] % mod * infact[a-b] %mod <<endl;;
}
return 0;
}
三 卢卡斯定理( log p N ⋅ P ⋅ l o g 2 p \log_p N\cdot P \cdot log_2p logpN⋅P⋅log2p)
求
C
a
b
m
o
d
p
C_a^b \mod p
Cabmodp
T
=
20
T=20
T=20
1
≤
b
≤
a
≤
1
0
18
,
1
≤
p
≤
1
0
5
且
p
为
质
数
1\leq b\leq a\leq 10^{18},1\leq p \leq 10^5且p为质数
1≤b≤a≤1018,1≤p≤105且p为质数
卢卡斯定理(lucas)
C
a
b
≡
C
a
m
o
d
p
b
m
o
d
p
+
C
a
/
p
b
/
p
m
o
d
p
C_a^b\equiv C_{a \mod p}^{b\mod p}+C_{a/p}^{b/p} \mod p
Cab≡Camodpbmodp+Ca/pb/pmodp
#include <iostream>
#include <algorithm>
using namespace std;
typedef long long LL;
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 C(int a, int b, int p)
{
if (b > a) return 0;
int res = 1;
for (int i = 1, j = a; i <= b; i ++, j -- )
{
res = (LL)res * j % p;
res = (LL)res * qmi(i, p - 2, p) % p;
}
return res;
}
int lucas(LL a, LL b, int p)
{
if (a < p && b < p) return C(a, b, p);
return (LL)C(a % p, b % p, p) * lucas(a / p, b / p, p) % p;
}
int main()
{
int n;
cin >> n;
while (n -- )
{
LL a, b;
int p;
cin >> a >> b >> p;
cout << lucas(a, b, p) << endl;
}
return 0;
}
四
高精度组合数
- 分解质因数
- 高精度乘法
#include<bits/stdc++.h>
using namespace std;
const int N = 5010;
int primes[N], cnt;
int sum[N];
bool st[N];
void get_primes(int n)
{
for (int i = 2; i <= n; i ++ )
{
if (!st[i]) primes[cnt ++ ] = i;
for (int j = 0; primes[j] <= n / i; j ++ )
{
st[primes[j] * i] = true;
if (i % primes[j] == 0) break;
}
}
}
int get(int n, int p)
{
int res = 0;
while (n)
{
res += n / p;
n /= p;
}
return res;
}
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_primes(a);
for (int i = 0; i < cnt; i ++ )
{
int p = primes[i];
sum[i] = get(a, p) - get(a - b, p) - get(b, p);
}
vector<int> res;
res.push_back(1);
for (int i = 0; i < cnt; i ++ )
for (int j = 0; j < sum[i]; j ++ )
res = mul(res, primes[i]);
for (int i = res.size() - 1; i >= 0; i -- ) printf("%d", res[i]);
puts("");
return 0;
}