传送门
题解:C(n,m)*d(m),
d表示错排,递推公式:d(n)=(n-1)*(d(n-1)+d(n-2))
P.S.注意特判!注意特判!注意特判!!!还有ios::sync_with_stdio(false)慎用,小心RE。。。
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MAXN=1e6+2;
const ll MOD=1e9+7;
int n,m;
ll fac[MAXN],d[MAXN];
inline void init() {
d[0]=1;//!!!!!!
fac[1]=1,fac[2]=2,d[1]=0,d[2]=1;
for (register int i=3;i<MAXN;++i)
fac[i]=fac[i-1]*i%MOD,d[i]=(d[i-1]+d[i-2])*(i-1)%MOD;
}
inline ll fpow(ll a,ll b,ll p) {
ll ret=1;
while (b) {
if (b&1) ret=ret*a%p;
b>>=1,a=a*a%p;
}
return ret;
}
inline ll comb(int n,int m) {
if (m==0||m==n) return 1;//!!!!!!
return fac[n]*fpow(fac[n-m]*fac[m]%MOD,MOD-2,MOD)%MOD;
}
inline int read() {
int x=0;char c=getchar();
while (c<'0'||c>'9') c=getchar();
while (c>='0'&&c<='9') x=x*10+c-'0',c=getchar();
return x;
}
int main() {
init();
int kase=read();
for (register int t=0;t<kase;++t) {
n=read(),m=read();
printf("%lld\n",comb(n,m)*d[n-m]%MOD);
}
return 0;
}