N!Again
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4347 Accepted Submission(s): 2304
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)!
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
Recommend
<strong><span style="font-size:24px;">#include<stdio.h>
int main()
{
long long n,s;
int i;
while(~scanf("%lld",&n))
{ s=1;
if(n>=41) 先把2009分解:2009=7*7*41,所以大于或等于41的都能
printf("0\n"); 整除2009
else if(n==0)
printf("1\n");
else
{
for(i=1;i<=n;i++)
s=(s*i)%2009; 我开始是用s*=i%2009:这样可能导致s超出范围溢出
printf("%lld\n",s); </span><span style="font-size:24px;"></span></strong><pre name="code" class="html" style="display: inline !important;"><span style="font-size:24px;">s%=2009</span>
} return 0;}