N!Again |
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) |
Total Submission(s): 1152 Accepted Submission(s): 644 |
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
看着吓人,其实纸老虎
下面是ac代码
所以分开判断就好了。。
至于为什么41的阶乘%2009为0,我是怎么发现的,建议可以边阶乘边对2009取余,并输出。你会发现第41个的输出为0,而且之后的都为0。
|
ACM刷题之HDU————N!Again
最新推荐文章于 2024-02-25 23:53:12 发布