hdoj 2674 N!Again
2015-09-20 11:09
483 查看
N!Again
[b]Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4152 Accepted Submission(s): 2232
[/b]
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
题意: 2009 =7*7*41,所以输入超过41的数取余后得到0,输入0,时输出1;
对于小于41的同余定理求,即可!
代码:
#include<stdio.h> int main() { int i,j,n; char s[1010]; while(scanf("%d",&n)!=EOF) { if(n>41) printf("0\n"); else if(n==0) printf("1\n"); else if(n<=41) { int sum=1; for(i=1;i<=n;i++) { sum=(sum*(i%2009))%2009; } printf("%d\n",sum); } } return 0; }
相关文章推荐
- VS2010编译Boost 1.56 http://blog.csdn.net/kangroger/article/details/39393769
- Aizu 2249 Road Construction(SPFA算法变形,好题)
- Failed to read key from keystore解决方案
- Climbing Stairs 解答
- CLOSE_WAIT的产生以及影响和解决方案
- YoMail,Gmail死忠粉的福音——直接收发Gmail邮件
- YoMail,Gmail死忠粉的福音——直接收发Gmail邮件
- dojo EnhancedGrid的两种实现方式对比,转载自http://blog.csdn.net/earthhour/article/details/17203515
- AIDL--------应用之间的通信接口
- Codeforces Round #320 (Div. 2) 579A Raising Bacteria(脑洞)
- Paint
- Trailing Zeroes (III)(lightoj 二分好题)
- relocation R_ARM_THM_MOVW_ABS_NC against `a local symbol' can not be used when making a shared objec
- 增益 Gain 分贝 dB
- Light oj 1138 - Trailing Zeroes (III)
- mexTrainDL - SPAms
- “warning C4251::CStringT<BaseType,StringTraits>需要有 dll 接口”解决办法
- Git Step By Step - Step 1: Start Over Again
- AI-路径导航(最短路径算法 and A算法)
- xcode7报错:does not contain bitcode