hdu 2674

N！Again

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 1779    Accepted Submission(s): 1009

Problem Description

WhereIsHeroFrom:             Zty, what are you doing ?
Zty:                                     I want to calculate N!......
WhereIsHeroFrom:             So easy! How big N is ?
Zty:                                    1 <=N <=1000000000000000000000000000000000000000000000…
WhereIsHeroFrom:             Oh! You must be crazy! Are you Fa Shao?
Zty:                                     No. I haven's finished my saying. I just said I want to calculate N! mod 2009


Hint : 0! = 1, N! = N*(N-1)!

 

Input

Each line will contain one integer N(0 <= N<=10^9). Process to end of file.

 

Output

For each case, output N! mod 2009

 

Sample Input

  
  

   
   4 
5
  
  

 

Sample Output

  
  

   
   24
120
  
  

暴力计算必然会TLE，N最大为10^9！

首先想到  N>=2009 时  N!==0。。。。。。

打表找规律吧。N>=41的结果都为0。因为N=40，结果为245，N=41时，结果为245*41=10045%2009=0。任何不小于41的n都得是

(((((0*42)%2009)*43)%2009)*44)%2009...结果显然为0了。

 #include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<cstring>
#include<algorithm>
#define N 16001
#define ll long long
using namespace std;
int main()
{
    long long n;
    while(scanf("%I64d",&n)!=EOF)
    {
        if(n>=41)
        printf("0\n");
        else
        {
            long long ans=1,i;
            for(i=1;i<=n;i++)
            {
                ans=(ans*i)%2009;
            }
            printf("%d\n",ans);
        }
    }
}