NOJ 1590 大整数阶乘
#include <iostream>
#include <cstdio>
using namespace std;
int a[50000];
int main()
{
int n;
scanf("%d",&n);
int i,j,digit;
int tmp,carry;
a[1]=1;
digit=1;
carry=0;
for(i=2;i<=n;i++)
{
carry=0;
for(j=1;j<=digit;j++)
{
tmp=a[j]*i+carry;
a[j]=tmp%10;
carry=tmp/10;
}
while(carry)
{
a[j]=carry%10;
j++;
carry/=10;
digit++;
}
}
for(i=digit;i>=1;i--)
{
printf("%d",a[i]);
}
printf("\n");
return 0;
}