BZOJ 4517 [Sdoi2016]排列计数

裸的错排公式，组合数用乘法逆元解决。
补一下错排公式 ：D(n) = (n-1) [D(n-2) + D(n-1)]

/**************************************************************
    Problem: 4517
    User: vermouth
    Language: C++
    Result: Accepted
    Time:15056 ms
    Memory:17072 kb
****************************************************************/
 
#include<cstdio>
#include<iostream>
#define ll long long
using namespace std;
const int maxn=1010010;
ll jie[maxn],cuo[maxn],mod=1000000007;
int T,m,n;
void inti()
{
    jie[1]=1;cuo[0]=cuo[2]=1;
    for(int i=2;i<=1000000;i++) jie[i]=jie[i-1]*i%mod;
    for(int i=3;i<=1000000;i++) cuo[i]=(i-1)*(cuo[i-2]+cuo[i-1])%mod;
}
ll x, y;
ll exgcd(ll a,ll b, ll &x, ll &y)
{
    if (b == 0){
        x = 1;
        y = 0;
        return a;
    }
    ll gcd=exgcd(b,a%b,x,y);
    ll tmp=x;x=y;
    y=tmp-(a/b)*y;
    return gcd;
}
inline ll getrev(ll a)
{
    ll x,y;
    ll gcd=exgcd(a,mod,x,y);
    if(!a||gcd>1) return 1;
    return (x+mod)%mod;
}
int main()
{
    inti(); 
    scanf("%d",&T);
    while(T--)
    {
        scanf("%d%d",&n,&m);
        if(m==n) {puts("1");continue;}
        if(m>n) {puts("0");continue;}
        ll res=jie[n];
        res=(res*getrev(jie[n-m]))%mod;
        res=(res*getrev(jie[m]))%mod;
        res=res*cuo[n-m]%mod;
        //cout<<cuo[n-m]<<endl;
        printf("%lld\n",res);
    }
    return 0;   
}