题意:给你一个数n,求n阶乘,(n < 1e4)
分析:用普通类型肯定会爆,我们把结果的数字分段,例如8个一段,用一个整型表示,在求阶乘时,把每一段分别与i相乘,然后模拟进位,最后注意最左边的一段不需要填充0,其他的段要在左边填充0。
#include <bits/stdc++.h>
#pragma GCC diagnostic error "-std=c++11"
#define d(x) cout << (x) << endl
#define INF 0x3f3f3f3f
using namespace std;
typedef long long ll;
const int mod = 1e8;
const int N = 1e4;
ll a[N];
int pos = 0;
int main()
{
int n;
scanf("%d", &n);
a[0] = 1;
for (int i = 1; i <= n; i++){
int carry = 0;
for (int j = 0; j <= pos; j++){
a[j] = a[j] * i + carry;
carry = a[j] / mod;
a[j] %= mod;
}
if(carry > 0){
a[++pos] = carry;
}
}
printf("%lld", a[pos]);
for (int i = pos - 1; i >= 0; i--){
printf("%0.8lld", a[i]);
}
printf("\n");
return 0;
}