打表的一些操作

例题
题目描述
李浩杰大晚上不睡觉,问了我一个问题: N!是多少?

我想了想,感觉和上周周赛的斐波那契有点像,于是就有了这个题目.

输入
输入一个T,表示T组数据 (1<=T<=100)

接下来T行,每行输入一个整数N(0<=N<=1000000000)

输出
输出T行,每行输出一个正整数 N!的结果 (由于这个数比较大,所以输出N!对1e9+7取模的结果).
样例输入
2
0
1000000000
样例输出
1

#include <stdio.h>
#include <iostream>
#include <string.h>
#include <math.h>
#include <stdlib.h>
#include <algorithm>
using namespace std;
const int z=1e9+7;
/*
int main ()
{
    long long n=1;
    for(int i=0;i<=1e9;i+=1e7){

        for(int j=i+1;j<=i+1e7;j++){
            n=(n*j)%z;
        }
        printf("%lld,",n);
        if(i%50000000==0)
        printf("\n");

    }
    system("pause");

	return 0;
}
*/



long long a [111]={1,682498929,
491101308,76479948,723816384,67347853,27368307,
625544428,199888908,888050723,927880474,281863274,
661224977,623534362,970055531,261384175,195888993,
66404266,547665832,109838563,933245637,724691727,
368925948,268838846,136026497,112390913,135498044,
217544623,419363534,500780548,668123525,128487469,
30977140,522049725,309058615,386027524,189239124,
148528617,940567523,917084264,429277690,996164327,
358655417,568392357,780072518,462639908,275105629,
909210595,99199382,703397904,733333339,97830135,
608823837,256141983,141827977,696628828,637939935,
811575797,848924691,131772368,724464507,272814771,
326159309,456152084,903466878,92255682,769795511,
373745190,606241871,825871994,957939114,435887178,
852304035,663307737,375297772,217598709,624148346,
671734977,624500515,748510389,203191898,423951674,
629786193,672850561,814362881,823845496,116667533,
256473217,627655552,245795606,586445753,172114298,
193781724,778983779,83868974,315103615,965785236,
492741665,377329025,847549272,698611116};
int main ()
{
    long long t,n,temp;
    scanf("%lld",&t);
    while(t--){
        scanf("%lld",&n);
        long long s=a[n/10000000];


        for (int i=(n/1e7)*1e7+1;i<=n;i++)
          s=(s*i)%z;
        printf("%lld\n",s);

    }

	return 0;
}