HDOJ 题目2674N！Again(数学，水题）

N！Again

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

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女生专场公开赛——谁说女子不如男

 

Recommend

lcy   |   We have carefully selected several similar problems for you:   2672  2668  2673  2669  2671 

  题目大意：

求N! % 2009的最大值，n最大10^9

解题思路：

2009不是质数，7 × 7 × 41 = 2009 ，所以41以后就不用算了，全是0！ 

ac代码

#include<stdio.h>
int main()
{
    int a;
    while(scanf("%d",&a)!=EOF)
    {
        int i,n=1;
        if(a<41)
        {
            for(i=1;i<=a;i++)
            {
                n=(n*i)%2009;
            }
            printf("%d\n",n);
        }
        else
            printf("0\n");
    }
}