大数阶乘（10000级别）　51Nod 1057

题目链接：

问题描述

Input

Output

Input示例

Output示例

思路：

#include<iostream>
#include<stdio.h>
#include<algorithm>
#define LL long long
using namespace std;
#define mod 100000000000000;//14个0
const int N = 1000086;
LL a
;

int main()
{
int n;
scanf("%d", &n);
LL l = 0;
a[0] = 1;

for(int i = 1; i <= n; i++)
{
LL c = 0;
for(int j = 0; j <= l; j++)
{
LL t = a[j] * i + c;
a[j] = t % mod;
c = t / mod;
}
if(c != 0)
{
l++;
a[l] = c;
}
}
printf("%lld", a[l]);

for(int i = l-1; i >= 0; i--)
{
printf("%014lld", a[i]);//保留前导0
}
return 0;
}