杭电ACM HDU 2674 N！Again

N！Again

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

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

 

 

Source

HDU女生专场公开赛——谁说女子不如男

 

A*B % C = (A%C * B%C)%C
(A+B)%C = (A%C + B%C)%C

如 532 mod 7 =（500%7+30%7+2%7)%7;
当然还有a*b mod c=(a mod c+b mod c)mod c;
如35 mod 3=((5%3)*(7%3))%3

 

Recommend

lcy

 

 

 

[cpp]  view plain copy

1. #include<cstdio>  
2. int main(){  
3.     int n,s,i;  
4.     while(~scanf("%d",&n)){  
5.         if(n>41)  
6.             printf("0\n");  
7.         else{  
8.             for(i=s=1;i<=n;i++){  
9.                 s*=i;  
10.                 s%=2009;  //( (1%2009)*2 )%2009
11.             }  
12.             printf("%d\n",s);  
13.         }  
14.     }  
15. }