hdoj-【2674 N！Again】

N！Again

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

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
#include<cstdio>#define maxn 2009int num[50]; int main(){num[0]=1; int n,i;for(i=1;i<41;++i){num[i]=num[i-1]*i%maxn; } while(scanf("%d",&n)!=EOF){if(n>=41){printf("0\n");continue; } printf("%d\n",num[n]%maxn); } return 0;}