N!Again
2015-08-02 18:38
399 查看
N!Again
Time Limit : 2000/1000ms (Java/Other) Memory Limit : 32768/32768K (Java/Other)
Total Submission(s) : 24 Accepted Submission(s) : 10
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的阶乘及其以后的数字对2009求模值为零,另外需要注意的是,n!%2009与1%2009*2%2009·····n%2009的值是一样的,所以不必在意多求了几次对2009的模,另外还要注意0%2009=1。
Time Limit : 2000/1000ms (Java/Other) Memory Limit : 32768/32768K (Java/Other)
Total Submission(s) : 24 Accepted Submission(s) : 10
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的阶乘及其以后的数字对2009求模值为零,另外需要注意的是,n!%2009与1%2009*2%2009·····n%2009的值是一样的,所以不必在意多求了几次对2009的模,另外还要注意0%2009=1。
#include<stdio.h> int main() { int i,n,ji[41]; while(scanf("%d",&n)!=EOF) { if(n>=41) { printf("0\n"); continue; } ji[0]=1; ji[1]=1; ji[2]=2; if(n>=3&&n<41) { for(i=3;i<41;i++) ji[i]=(ji[i-1]*i)%2009; } printf("%d\n",ji ); } return 0; }
相关文章推荐
- Snail—算法学习之初始递归
- orcale 约束 constraint
- [leedcode 172] Factorial Trailing Zeroes
- CF_22B_BargainingTable
- 浅析绑定远程服务bindService基本原理与AIDL分析
- hdu 5336 XYZ and Drops 2015 Multi-University Training Contest 4 10
- OC学习笔记四-1 内存管理(Retain-Release)
- netstat监控大量ESTABLISHED连接与Time_Wait连接问题
- Email 验证
- http://blog.csdn.net/uranus_wm/article/details/9838847
- reGeorg+proxychains-ng组合试用
- reGeorg+proxychains-ng组合试用
- 【LeetCode】217 & 219 - Contains Duplicate & Contains Duplicate II
- LeetCode:Climbing Stairs(DP)
- MainWindow简介
- tftp服务器连接开发板下载内核提示:retry count exceeded; starting again
- RuntimeError: Broken toolchain: cannot link a simple C program
- ORA-02291: integrity constraint (SYSTEM.FK1170E5C5328E4352) violated 解决办法
- 机器学习(吴恩达授课)课堂笔记(1)- Intro
- mvn generate-sources failed: Invalid SDK: Platform/API level 15 not available