Pagini recente » Cod sursa (job #2667482) | Cod sursa (job #2006442) | Cod sursa (job #951034) | Cod sursa (job #497948) | Cod sursa (job #124001)
Cod sursa(job #124001)
#include<stdio.h>
#include<string.h>
#define B 1000000
#define nr 6
FILE*f=fopen("patrate2.in","r");
FILE*g=fopen("patrate2.out","w");
long long n,a[5000],p[5000],z[5000];
void inmult(long long c[],long long k)
{
long long i,t,x;
t=0; i=1;
while(i<=c[0]||t>0)
{
t+=c[i]*k;
c[i]=t%B;
t=t/B;
i++;
}
c[0]=i-1;
}
void inmultire(long long a[],long long b[])
{
long 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)%B;
t=(c+t)/B;
}
if(t>0) z[++z[0]]=t;
}
/*void afisare()
{
long long x,pr,j;
fprintf(g,"%lld",z[z[0]]);
for(long i=z[0]-1;i>=1;--i)
{
for(x=z[i],pr=0;x;++pr,x=x/10);
for(j=1;j<=nr-pr;++j) fprintf(g,"0");
fprintf(g,"%lld",z[i]);
}
fprintf(g,"\n");
}
*/
void afisare()
{
long long x,c,i;
for (i=z[0]; i>=1; i--)
{
c=0; x=z[i];
if (z[i])
{
while (x) {c++; x/=10;}
for (x=nr; x>c; x--) if (i!=z[0]) fprintf(g,"0");
fprintf(g,"%lld",z[i]);
}
else fprintf(g,"000000");
}
fprintf(g,"\n");
}
int main()
{
fscanf(f,"%lld",&n);
long i;
z[0]=1; z[1]=2;
for(i=1;i<n*n;++i)
{
if(i<=n) inmult(z,2*i);
else inmult(z,2);
}
afisare();
return 0;
}