Hdu1042 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

1

2

3

 

Sample Output

1

2

6

 

模板，每次计算阶乘数值，并将每位数值存放在数组中，模拟手算的原理，每次从低位开始乘，逐步到高位，期间不停更新数组中的数值。

 #include <iostream>
 #include <cstdio>
 #include <algorithm>
 #include <cstring>
 #include <string.h>
 using namespace std;
 const int maxn=;
 int d[maxn];
 int main()
 {
     int n;
     while(cin>>n){
         memset(d,,sizeof(d));
         d[]=;
         int t=,tmp=,carry=;
         for(int i=;i<=n;i++){
             for(int j=;j<=t;j++){
                 tmp=d[j]*i+carry;
                 d[j]=tmp%;
                 carry=tmp/;
             }
             while(carry!=){
                 d[++t]=carry%;
                 carry/=;
             }
         }
         for(int i=t;i>=;i--){
             cout<<d[i];
         }
         cout<<endl;
     }
     return ;
 }