N! 大数万进制
Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)
Total Submission(s): 100122 Accepted Submission(s): 29953
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
dig 位数
cary 进位
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
void deal(int n)
{
int dig=1,cary;
int a[10001]={1};
for(int i=2;i<=n;i++)
{
cary=0;
for(int j=0;j<dig;j++)
{
a[j]=a[j]*i+cary;
cary=a[j]/10000;
a[j]%=10000;
}
if(cary>0)
{
a[dig++]=cary;
}
}
printf("%d",a[dig-1]);
for(int i=dig-2;i>=0;i--)
{
printf("%04d",a[i]);
}
}
int main()
{
int n;
while(~scanf("%d",&n))
{
deal(n);
printf("\n");
}
return 0;
}