HDU5976 Detachment

 /*
  HDU5976 Detachment
  http://acm.hdu.edu.cn/showproblem.php?pid=5976
  数论 等差数列
  *
  *
  */
 #include <cstdio>
 #include <algorithm>
 #include <vector>
 using namespace std;
 const int mod=;
 const int Nmax=;
 vector<long long> v;
 long long f[Nmax];
 long long g[Nmax];
 long long qpow(long long base,int n)
 {
     long long ans=1LL;
     base=base%mod;
     while(n>)
     {
         if(n&)
             ans=ans*base%mod;
         base=(base*base)%mod;
         n>>=;
     }
     while(ans<)
         ans+=mod;
     return ans;
 }

 int main()
 {
     //freopen("3.in","r",stdin);
     int t;
     scanf("%d",&t);
     long long x;
     f[]=1LL;

     f[]=0LL;
     f[]=2LL;
     g[]=1LL;
     g[]=2LL;
     v.push_back(f[]);
     v.push_back(f[]);
     for(int i=;i<Nmax;i++)
     {
         g[i]=1LL*i*g[i-]%mod;
         f[i]=1LL*i+f[i-];
         v.push_back(f[i]);
     }
     //printf("%lld\n",f[Nmax-1]);
     while(t--)
     {
         long long ans=1LL;
         scanf("%lld",&x);
         int j=;
         int k=;
         for(int i=;i<Nmax;i++)
         {
             if(x>=f[i] && x<f[i+])
             {
                 j=i;
                 break;
             }
         }
         //printf("bj:%d\n",j);
         j=lower_bound(v.begin(),v.end(),x)-v.begin();
         while(!(x>=f[j]&& x<f[j+]))
             j++;
         //printf("j:%d\n",j);
         long long remain=x-f[j];
         if(remain)
         {
             if(remain==j)
                 k=;
             else
                 k=j+-remain;
             //printf("j:%d k:%d\n",j,k);
             ans=g[j];
             ans=ans*qpow(1LL*k, mod- )%mod;
             ans=ans*(k+remain)%mod;
         }
         else
         {
             ans=g[j];
         }
         while(ans<)
             ans+=mod;
         printf("%lld\n",ans);
     }
     return ;
 }