错排有两张写法:
递推 p[i]=(i-1)*(p[i-2]+p[i-1]);
容斥:=n!(1-1/1!+1/2!-1/3!+…………(-1)^n*1/n!)
luogu1595裸的错排:
方法1:
#include<iostream>
using namespace std;
int main(){
long long p[21]={1},f=1,ans;
int n;
cin>>n;
p[1]=0;p[2]=1;
ans=0ll;
for(int i=3;i<=n;i++)
p[i]=(i-1)*(p[i-2]+p[i-1]);
cout<<p[n]<<endl;
return 0;
}
方法二:
#include<iostream>
using namespace std;
int main(){
long long p[21]={1},f=1,ans;
int n;
cin>>n;
for(int i=1;i<=n;i++)
p[i]=p[i-1]*i;
ans=0ll;
for(int i=2;i<=n;i++)
ans=ans+f*p[n]/p[i],f=-f;
cout<<ans<<endl;
return 0;
}
4071的数据范围比较大,要先预处理,组合数取模,可以用递推求逆元。
#include <iostream>
#include <cstdio>
using namespace std;
typedef long long ll;
const int N=1000005;
int T, n, m, fac[N], inv[N], d[N];
const int mod=1e9+7;
int main(){
//d(n)=(n-1)*(d(n-1)+d(n-2))
//ans=c(n,m)*d(n-m);
fac[0] = fac[1] = inv[0] = inv[1] = d[0] = d[2] = 1;
for(int i=3; i<=1000000; i++)
d[i] = (ll)(i-1) * (d[i-1] + d[i-2]) % mod;
for(int i=2; i<=1000000; i++){
fac[i] = (ll)fac[i-1] * i % mod;
inv[i] = (ll)(mod - mod / i) * inv[mod%i] % mod;
}
for(int i=2; i<=1000000; i++)
inv[i] = (ll)inv[i-1] * inv[i] % mod;
cin>>T;
while(T--){
scanf("%d %d", &n, &m);
int ans=(ll)fac[n]*inv[m]%mod*inv[n-m]%mod*d[n-m]%mod;
printf("%d\n", ans);
}
return 0;
}