HDU 2674 N！Again

最新推荐文章于 2026-06-18 22:31:57 发布

转载最新推荐文章于 2026-06-18 22:31:57 发布 · 196 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

原文链接：http://www.cnblogs.com/yeshadow937/p/3927457.html

标签

#java #php

收录于

本文提供了一种使用C语言解决数学问题的方法，具体为计算N的阶乘（N!）模2009的值，适用于N在0到10^9之间的整数。通过示例输入和输出，展示了如何有效地进行大数运算，并给出了完整的源代码。

N！Again

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

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

Sample Output

120

题目来源：http://acm.hdu.edu.cn/showproblem.php?pid=2674

 1 #include <stdio.h>
 2 #include <stdlib.h>
 3 int main() 
 4 {
 5     int n;
 6     int ans,i;
 7     while(~scanf("%d",&n))
 8     {
 9         ans=1;
10         if(n>=2009)
11             printf("0\n");
12         else
13         {
14             for(i=1;i<=n;i++)    
15             {
16                 ans*=i;
17                 ans%=2009;
18             }
19             printf("%d\n",ans);    
20         }
21     }
22     return 0;
23 }