Pagini recente » Cod sursa (job #506678) | Cod sursa (job #1494411) | Cod sursa (job #2828260) | Cod sursa (job #1151496) | Cod sursa (job #69227)
Cod sursa(job #69227)
#include<stdio.h>
#include<string.h>
FILE*f=fopen("patrate2.in","r");
FILE*g=fopen("patrate2.out","w");
long n,a[150000],p[150000],z[150000];
void inmult(long c[],long k)
{
long i,t=0,x;
for(i=1;i<=c[0];++i)
{
x=c[i];
c[i]=(c[i]*k+t)%10;
t=(x*k+t)/10;
}
if(t>0)
{
c[++c[0]]=t;
}
}
void inmultire(long a[], long b[])
{
long j,i,t=0,c;
for(i=1;i<=a[0];++i)
for(j=1;j<=b[0];++j)
z[i+j-1]+=a[i]*b[j];
z[0]=a[0]+b[0]-1;
for(i=1;i<=z[0];++i)
{
c=z[i];
z[i]=(z[i]+t)%10;
t=(c+t)/10;
}
if(t>0) z[++z[0]]=t;
}
void afisare()
{
for(long i=z[0];i>=1;--i) fprintf(g,"%ld",z[i]);
fprintf(g,"\n");
}
int main()
{
fscanf(f,"%ld",&n);
long i;
p[0]=1; p[1]=1;
for(i=1;i<=n*n;++i) {inmult(p,2);}
a[0]=1; a[1]=1;
for(i=1;i<=n;++i) inmult(a,i);
inmultire(p,a);
afisare();
return 0;
}