HDU 2674 N!mod2009

N！Again

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

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
  
  

 

Author

WhereIsHeroFrom

如果n大于40结果为0  因为2009的因子为 7 41 49 287 当n大于41时 必有41 和 7*7出现 所以为0  

#include<cstdio>
#include<iostream>
using namespace std;
int main()
{
   long long int n=0;
   while(scanf("%lld",&n)!=EOF)
   {
    if(n>40)
     printf("0\n");
    else
    {
    int mod=1;
    for(int i=1;i<=n;i++)
    {
    mod=(mod*i)%2009;
    }
    printf("%d\n",mod);
    }
   }
}