大数存储――阶乘

2014-11-24 07:47:18 · 作者: · 浏览: 0
void jieCheng(int N)
{
int a[64];
int n, i, c, p;
int len = 1;
a[0] = 1;
//计算
for (n=N; n>1; n--) {
c=0;
for (i=0; i
p=a[i]*n+c;//计算
a[i]= p%10000;
c = p/10000;
}
//存储并标记长度
a[i]=c;
if (c>0) {
len++;
}
}
//打印
printf("%d,",a[len-1]);
for (i=len-2; i>=0; i--) {
printf("%04d",a[i]);
}
printf("\n");
}