hdu 4535 吉哥系列故事——礼尚往来

#include <cstdio>
#include <cstring>
#include <algorithm>
#define ll long long
#define maxn 10000
using namespace std;
const ll mod=1000000000+7;

int t;
int n;
ll a[maxn];

int main()
{
scanf("%d",&t);
a[1]=0; a[2]=1;
for(int i=3; i<=100; i++)
{
a[i]=((i-1)*(a[i-2]+a[i-1]))%mod;
}
while(t--)
{
scanf("%d",&n);
printf("%lld\n",a
);
}
return 0;
}