Pagini recente » Cod sursa (job #773225) | Cod sursa (job #1265110) | Cod sursa (job #495740) | Cod sursa (job #1490381) | Cod sursa (job #321609)
Cod sursa(job #321609)
#include <stdio.h>
FILE *f,*s;
long int n,v1[100001],v2[100001];
long int i,j;
void inmultire( long int x[100001], long int y)
{
long long T=0;
for(i=1;i<=x[0];i++)
{
x[i]=x[i]*y+T;
T=x[i]/1000000;
x[i]=x[i]%1000000;
}
while (T)
{
x[0]++;
x[x[0]]=T%1000000;
T/=1000000;
}
}
void inmultire2( long int x[100001], long int y[100001])
{
long long int T=0, R[10001];
R[0]=x[0]+y[0]-1;
for(i=1;i<=x[0]+y[0];) R[i++]=0;
for (i=1;i<=x[0];i++)
for (j=1;j<=y[0];j++)
R[i+j-1]+=x[i]*y[j];
for (i=1;i<=R[0];i++)
{
R[i]+=T;
T=R[i]/1000000;
R[i]%=1000000;
}
if (T)
{
R[0]++;
R[R[0]]=T;
}
x[0] = R[0];
for(i=1;i<=x[0];i++)
x[i]=R[i];
}
int main()
{
f=fopen("patrate2.in","r");
s=fopen("patrate2.out","w");
fscanf(f,"%ld",&n);
v1[0]=1;
v1[1]=2;
for(j=2;j<=n*n;j++)
inmultire(v1,2);
v2[0]=1;
v2[1]=1;
for(j=2;j<=n;j++)
inmultire(v2,j);
inmultire2(v2,v1);
fprintf(s,"%ld",v2[v2[0]]);
for(j=v2[0]-1;j>0;j--)
fprintf(s,"%06ld",v2[j]);
fclose(s);
return 0;
}