Pagini recente » Cod sursa (job #2567446) | Cod sursa (job #2338240) | Cod sursa (job #2370314) | Cod sursa (job #2770272) | Cod sursa (job #344171)
Cod sursa(job #344171)
#include <cstdio>
#include <string>
#define DIM 100000
int a[DIM],n,b[DIM];
long long m;
using namespace std;
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;
for (i=1; i<=m; ++i) mul(b,2);
mula(a,b);
for (i=a[0]; i>=1; --i) printf("%d",a[i]);
}
int main()
{
int i;
freopen("patrate2.in","r",stdin);
freopen("patrate2.out","w",stdout);
scanf ("%d",&n);
solve();
return 0;
}