错排公式
LL solve(int x){ LL res=0; for(int i=2;i<=x;i++){ LL as=(f[x]*pf[i])%MOD; if(i&1){ res=(res-as+MOD)%MOD; } else res=(res+as)%MOD; } return res;}
来源: http://www.bubuko.com/infodetail-2605829.html