hdu 4535 错排

题意：错排

链接：点我

百年难得一遇大水题

 #include<cstdio>
 #include<iostream>
 #include<algorithm>
 #include<cstring>
 #include<cmath>
 #include<queue>
 #include<map>
 using namespace std;
 #define MOD 1000000007
 const int INF=0x3f3f3f3f;
 const double eps=1e-;
 #define cl(a) memset(a,0,sizeof(a))
 #define ts printf("*****\n");
 const int MAXN=;
 int n,m,tt;
 long long f[];
 void init()
 {
     f[]=;
     f[]=;
     for(int i=;i<=;i++)
     {
         f[i]=f[i-]+f[i-];
         f[i]%=MOD;
         f[i]*=(i-);
         f[i]%=MOD;
     }
 }
 int main()
 {
     int i,j,k;
     #ifndef ONLINE_JUDGE
     freopen("1.in","r",stdin);
     #endif
     scanf("%d",&tt);
     init();
     while(tt--)
     {
         scanf("%d",&n);
         printf("%I64d\n",f[n]);
     }
 }