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)!
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
24120
题意:求n的阶乘;
思路:当数很大时,要记得每一步都要取余,(当n大于2009时,阶乘%2009=0);
#include<cstdio> #include<cstring> #include<algorithm> using namespace std; char str[300]; int main() { long long n,i,k,s; while(scanf("%lld",&n)!=EOF) { if(n>=2009) { printf("0\n"); continue; } s=1; for(i=1;i<=n;i++) { s=(s%2009)*(i%2009); s=s%2009; } printf("%lld\n",s); } return 0; }