【HDOJ6600】Just Skip The Problem（签到）

题意：询问n!模1e6+7的结果

n<=1e9

思路：

 #include<bits/stdc++.h>
 using namespace std;
 typedef long long ll;
 typedef unsigned int uint;
 typedef unsigned long long ull;
 typedef pair<int,int> PII;
 typedef pair<ll,ll> Pll;
 typedef vector<int> VI;
 #define N  110000
 #define M  1100000
 #define fi first
 #define se second
 #define MP make_pair
 #define pi acos(-1)
 #define mem(a,b) memset(a,b,sizeof(a))
 #define rep(i,a,b) for(int i=(int)a;i<=(int)b;i++)
 #define per(i,a,b) for(int i=(int)a;i>=(int)b;i--)
 #define lowbit(x) x&(-x)
 #define Rand (rand()*(1<<16)+rand())
 #define id(x) ((x)<=B?(x):m-n/(x)+1)
 #define ls p<<1
 #define rs p<<1|1

 const int MOD=1e6+;
       double eps=1e-;
       ll INF=1e14;

 int read()
 {
    int v=,f=;
    char c=getchar();
    while(c<||<c) {if(c=='-') f=-; c=getchar();}
    while(<=c&&c<=) v=(v<<)+v+v+c-,c=getchar();
    return v*f;
 }

 int main()
 {
     //freopen("1.in","r",stdin);
     //freopen("1.out","w",stdout);
     int n;
     while(scanf("%d",&n)!=EOF)
     {
         ll ans=;
         if(n>=MOD)
         {
             printf("0\n");
             continue;
         }

         rep(i,,n) ans=ans*i%MOD;
         printf("%I64d\n",ans);
     }
     return ;
 }