N的阶乘（一个好的模板）

Viscu

于 2016-07-22 11:22:52 发布

阅读量3.2k

点赞数 1

分类专栏：算法

本文链接：https://blog.csdn.net/Viscu/article/details/51993062

版权

算法专栏收录该内容

9 篇文章 0 订阅

订阅专栏

#include<iostream>
#include<cmath>
#include<cstring>
#include<cstdlib>
#include<algorithm>
#include<cmath>
#include<ctime>
#include<string>
#include<stack>
#include<deque>
#include<queue>
#include<list>
#include<set>
#include<map>
#include<cstdio>
#define mes(x) memset(x, 0, sizeof(x))
typedef long long ll;
#define Pii pair<int, int>
#define Pll pair<ll, ll>
#define INF 0x3f3f3f3f
using namespace std;
const int MAX = 4500;　//n的范围是１～10000
#define MOD 100000000
int main()
{
    int n, i, j, c;
    cin >> n;
    ll *fac = new ll[MAX]();
    ll sum;
    fac[0] = 1;
    int m = 0;
    for(i = 2; i <= n; ++i)
    {
        c = 0;
        for(j = 0; j <= m; ++j)
        {
            sum = fac[j]*i + c;
            c = sum/MOD;
            fac[j] = sum%MOD;
        }
        if(c>0)
        {
            fac[++m] = c;
        }
    }
    printf("%lld", fac[m]);
    for(int i = m-1; i >= 0; --i)
        printf("%08lld", fac[i]);　　// 一个空间存８个长度　例如100000008%100000000 = 8 %08ll补全８前面的零
    cout << endl;
    delete [] fac;
    return 0;
}