N!解题报告
2012-04-07 13:22
288 查看
N!
[b]Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 30093 Accepted Submission(s): 8264
[/b]
Problem Description
Given an integer N(0 ≤ N ≤ 10000), your task is to calculate N!
Input
One N in one line, process to the end of file.
Output
For each N, output N! in one line.
Sample Input
1 2 3
Sample Output
1 2 6
Author
JGShining(极光炫影)
#include<stdio.h> #include<iostream> #include<string.h> using namespace std; const int maxn = 50000; int f[maxn]; int main() { int i,j,n; while(cin>>n) { memset(f,0,sizeof(f)); f[0]=1; { for(i=2;i<=n;i++) { int c=0; for(j=0;j<maxn;j++) { int s=f[j]*i+c; f[j]=s%10; c=s/10; } } for(j=maxn-1;j>=0;j--) { if(f[j]) break; } for(i=j;i>=0;i--) { cout<<f[i]; } cout<<endl; } } return 0; }
相关文章推荐
- HIT summer training Contest 11 / 解题报告
- UVA 424 解题报告
- Leetcode #29 Divide Two Integers 整数相除 解题报告
- 10.3解题报告
- 解题报告 新兵站队
- UVA 152 解题报告
- 组合数问题 解题报告
- 解题报告 比赛
- hdu 1242 Rescue bfs+优先队列 解题报告
- [LeetCode] 417. Pacific Atlantic Water Flow 解题报告
- 2014年蓝桥杯预赛 C/C++本科B组 解题报告 史丰收速算
- [LeetCode]Department Highest Salary,解题报告
- [spoj10707]Count on a tree II 解题报告
- POJ1724 ROADS 解题报告【最短路/SPFA】
- TYVJ 1142 阶乘统计3 解题报告
- UVA 400 解题报告
- HDU解题报告——1019
- Uva 1315 - Crazy tea party 解题报告(找规律)
- hdu 1285 确定比赛名次 拓扑排序 解题报告
- [LeetCode] 482. License Key Formatting 解题报告