High precision factorial

Description

use High precision method , seek N!N! The exact value of (NN Enter as normal integer ).

Input

10

Output

3628800
 

Samples

Input 

10

output

3628800

​
#include<bits/stdc++.h>
using namespace std;
long long a[1000001],m,n,i,j,k,l=1,x;//l Length ; 
int main()
{
	cin>>n; 
    for(i=1;i<=1000;i++)// Here for the sake of time 1000; 
    {
    	a[i]=0;
	}
	a[1]=1;
	for(i=1;i<=n;i++)
	{
		x=0;
		for(j=1;j<=l;j++)
		{
			a[j]=a[j]*i+x;
			x=a[j]/10;
			a[j]=a[j]%10;
		}
		while(x>0)
		{
			l++;
			a[l]+=x;
			x=a[l]/10;
			a[l]=a[l]%10;
		}
	}
	for(i=l;i>=1;i--)
	{
	   cout<<a[i];
	}
	return 0;
}

​

In fact, the basic principle of utilization is ： A character array , An operation , loop ;

You can try to debug the program to explore ;