Pagini recente » Cod sursa (job #176863) | Cod sursa (job #1054772) | Cod sursa (job #262356) | Cod sursa (job #3032776) | Cod sursa (job #177030)
Cod sursa(job #177030)
#include <stdio.h>
int n;
long i,s[300],p[300],baza=1000000,j,c,k,x;
int main()
{
freopen ("patrate2.in","r",stdin);
freopen ("patrate2.out","w",stdout);
scanf("%d",&n);
p[0]=1;p[1]=1;
for (i=1;i<=n*n;i++){
c=0;
for (j=1;j<=p[0];j++){
p[j]=p[j]*2+c;
c=p[j]/baza;
p[j]%=baza;
}
if(c!=0)p[++p[0]]=c;
}
for (i=2;i<=n;i++){
c=0;
for (j=1;j<=p[0];j++){
p[j]=p[j]*i+c;
c=p[j]/baza;
p[j]%=baza;
}
if(c!=0)p[++p[0]]=c;
}
for(i=200;i>=1;i--)
if(p[i]!=0)
{printf("%ld",p[i]);break;}
i--;
for (j=i;j>=1;--j)
{
if(p[j]!=0){
x=p[j];c=0;
while(x!=0){c++;x/=10;}
for(x=1;x<=6-c;++x)printf("0");
printf("%ld",p[j]);}
else printf("00000000");
}
return 0;
}