hdu1042

maksyuki 发表于 oj 分类，标签: 基础算法-高精度

15 9月 2015

N!

Problem Description

Given an integer N(0 ≤ N ≤ 10000), your task is to calculate N!

Input

One N in one line, process to the end of file.

Output

For each N, output N! in one line.

Sample Input

Sample Output

Author

JGShining（极光炫影）

题目类型：高精度阶乘

算法分析：直接使用数组模拟即可

#include <set>
#include <bitset>
#include <list>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <string>
#include <vector>
#include <ios>
#include <iostream>
#include <fstream>
#include <sstream>
#include <iomanip>
#include <algorithm>
#include <utility>
#include <complex>
#include <numeric>
#include <functional>
#include <cmath>
#include <ctime>
#include <climits>
#include <cstdarg>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cctype>
#include <cassert>

#define lson rt << 1, l, m
#define rson rt << 1 | 1, m + 1, r

using namespace std;

const int INF = 0x7FFFFFFF;
const double EPS = 1e-10;
const double PI = 2 * acos (0.0);
const int MOD = 7;

const int maxn = 100000 + 66;

int ans[maxn], len;

int main()
{
//    ifstream cin ("aaa.txt");

    int n;
    while (cin >> n)
    {
        memset (ans, 0, sizeof (ans));
        len = 1;
        ans[0] = 1;

        for (int i = 1; i <= n; i++)
        {
            int k = 0;
            for (int j = 0; j < len; j++)
            {
                int temp = ans[j] * i + k;
                ans[j] = temp % 10;
                k = temp / 10;
            }

            while (k)
            {
                ans[len++] = k % 10;
                k /= 10;
            }
        }

        for (int i = len - 1; i >= 0; i--)
            cout << ans[i];
        cout << endl;

    }

return 0;
}

#include <set>

#include <bitset>

#include <list>

#include <map>

#include <stack>

#include <queue>

#include <deque>

#include <string>

#include <vector>

#include <ios>

#include <iostream>

#include <fstream>

#include <sstream>

#include <iomanip>

#include <algorithm>

#include <utility>

#include <complex>

#include <numeric>

#include <functional>

#include <cmath>

#include <ctime>

#include <climits>

#include <cstdarg>

#include <cstdio>

#include <cstdlib>

#include <cstring>

#include <cctype>

#include <cassert>

#define lson rt << 1, l, m

#define rson rt << 1 | 1, m + 1, r

using namespace std;

const int INF = 0x7FFFFFFF;

const double EPS = 1e-10;

const double PI = 2 * acos (0.0);

const int MOD = 7;

const int maxn = 100000 + 66;

int ans[maxn], len;

int main()

{

// ifstream cin ("aaa.txt");

int n;

while (cin >> n)

{

memset (ans, 0, sizeof (ans));

len = 1;

ans[0] = 1;

for (int i = 1; i <= n; i++)

{

int k = 0;

for (int j = 0; j < len; j++)

{

int temp = ans[j] * i + k;

ans[j] = temp % 10;

k = temp / 10;

}

while (k)

{

ans[len++] = k % 10;

k /= 10;

}

for (int i = len - 1; i >= 0; i--)

cout << ans[i];

cout << endl;

}

return 0;

}

hdu1028

hdu1075

一	二	三	四	五	六	日
« 6月
						1
2	3	4	5	6	7	8
9	10	11	12	13	14	15
16	17	18	19	20	21	22
23	24	25	26	27	28	29
30	31

超客的水墨烟雨

hdu1042

N!

分类目录

标签云

书签

近期评论