Pagini recente » Cod sursa (job #1953186) | Cod sursa (job #809162) | Cod sursa (job #1421415) | Cod sursa (job #2179142) | Cod sursa (job #124011)
Cod sursa(job #124011)
#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 n,a[5000],p[5000],z[5000];
void inmult(long long A[],long long B)
{
long i, t = 0;
for (i = 1; i <= A[0] || t; i++, t /= 1000000)
A[i] = (t += A[i] * B) % 1000000;
A[0] = i - 1;
}
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)%B;
t=(c+t)/B;
}
if(t>0) z[++z[0]]=t;
}
void afisare()
{
long x,pr,j;
fprintf(g,"%ld",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,"%ld",z[i]);
}
fprintf(g,"\n");
}
int main()
{
//fscanf(f,"%ld",&n);
n=5;
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;
}