Pagini recente » Cod sursa (job #1870885) | Cod sursa (job #1536809) | Cod sursa (job #716863) | Cod sursa (job #93665) | Cod sursa (job #344175)
Cod sursa(job #344175)
#include <fstream>
#include <string>
#define DIM 2<<15
int a[DIM],n,c[DIM],b[DIM];
long long m;
using namespace std;
ifstream fin("patrate2.in");
ofstream fout("patrate2.out");
void mul(int A[], int B)
{
int i, t = 0;
for (i = 1; i <= A[0] || t; i++, t /= 10)
A[i] = (t += A[i] * B) % 10;
A[0] = i - 1;
}
void mula(int A[], int B[])
{
int i, j, t, C[10000];
memset(C, 0, sizeof(C));
for (i = 1; i <= A[0]; i++)
{
for (t=0, j=1; j <= B[0] || t; j++, t/=10)
C[i+j-1]=(t+=C[i+j-1]+A[i]*B[j])%10;
if (i + j - 2 > C[0]) C[0] = i + j - 2;
}
memcpy(A, C, sizeof(C));
}
void solve()
{
int i;
a[0]=1;a[1]=1;
for (i=2; i<=n; ++i) mul(a,i);
m=n*n;
b[0]=1;b[1]=1;
c[0]=1;c[1]=2;
while (m)
{
if (m%2)
mula(b,c);
mula(c,c);
m/=2;
}
mula(a,b);
for (i=a[0]; i>=1; --i) fout<<a[i];
}
int main()
{
fin>>n;
solve();
return 0;
}