Pagini recente » Cod sursa (job #324380) | Cod sursa (job #508881) | Cod sursa (job #2160782) | Cod sursa (job #1605260) | Cod sursa (job #550757)
Cod sursa(job #550757)
#include<cstdio>
#include<string>
#define infile "patrate2.in"
#define outfile "patrate2.out"
#define L 10000
using namespace std;
void citeste();
void rezolva();
void afiseaza();
void prod(int[],int);
void prod_big(int[],int[]);
int rez[L], fact[L];
int n;
void citeste()
{
freopen(infile,"r",stdin);
scanf("%d",&n);
fclose(stdin);
}
void powlog(int x, int y)
{
int f[32];
memset(f,0,sizeof(f));
while(y)
{
f[0]++;
if(y%2) f[f[0]]=1;
y/=2;
}
for(int i=f[0];i>=1;i--)
{
prod_big(rez,rez);
if(f[i]) prod(rez,x);
}
}
void prod_big(int A[], int B[])
{
int i, j, t, C[L];
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 prod(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 rezolva()
{
rez[0]=rez[1]=fact[0]=fact[1]=1;
powlog(2,n*n);
for(int i=2;i<=n;i++) prod(fact,i);
prod_big(rez,fact);
}
void afiseaza()
{
freopen(outfile,"w",stdout);
for(int i=rez[0];i>=1;i--)
printf("%d",rez[i]);
fclose(stdout);
}
int main()
{
citeste();
rezolva();
afiseaza();
return 0;
}