Pagini recente » Cod sursa (job #2524995) | Cod sursa (job #1393254) | Cod sursa (job #1887530) | Cod sursa (job #1963504) | Cod sursa (job #422904)
Cod sursa(job #422904)
#include<stdio.h>
int n;
int i, X=2,j;
unsigned long T=0;
int H[1000];
void mult(int X)
{
T=0;
for (i=1;i<=H[0];i++)
{ H[i]=H[i]*X+T;
T=H[i]/10;
H[i]=H[i]%10;
}
while (T)
{ H[++H[0]]=T%10;
T/=10;
}
}
int main()
{
freopen("patrate2.in", "r", stdin);
freopen("patrate2.out", "w", stdout);
scanf("%d", &n);
H[0]=1;
H[1]=1;
int aux=n*n;
for(j=1;j<=n*n/6;j++)
mult(64);
for(j=1;j<=n*n-n*n/6*6;j++)
mult(2);
for(j=1;j<=n;j++)
mult(j);
for(j=H[0];j>=1;j--)
printf("%d", H[j]);
return 0;
}