HDU 1042 N！（高精度）

N!

Time Limit: 10000/5000 MS (Java/Others)    Memory Limit: 262144/262144 K (Java/Others)
Total Submission(s): 95835    Accepted Submission(s): 28507

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

Author

JGShining（极光炫影）

求N！

复习一下高精度。。。其实也就是简单模拟

/*高精度*/
/*10000！ 总共 36000 位*/
#include <iostream>
#include <cstdio>
#include <string>
#include <cstring>
#include <algorithm>
#include <queue>
#include <stack>
#define ll long long
#define Max 36001
using namespace std;

int main() {
  int n,num[Max];
  while(cin>>n) {
    memset(num,0,sizeof(num));
    num[0]=1;//长度
    num[1]=1;
    for(int i=2; i<=n; i++) {
      int len=num[0];
      for(int j=1; j<=len; j++)
        num[j]*=i;
      //处理进位
      for(int j=1; j<=num[0]; j++) {
        if(num[j]>9) {
          num[j+1]+=num[j]/10;
          num[j]%=10;
        }
        if(num[num[0]+1]) num[0]++;//长度更新
      }
    }
//    cout<<num[0]<<endl;
    for(int i=num[0]; i>=1; i--)
      cout<<num[i];
    cout<<endl;
  }

  return 0;
}