Pagini recente » Cod sursa (job #465169) | Cod sursa (job #921751) | Cod sursa (job #254706) | Cod sursa (job #3156243) | Cod sursa (job #157905)
Cod sursa(job #157905)
#include <stdio.h>
#define N 1100
int A[N];
void mul(int A[], int B){
int i, t = 0;
for (i = 1; i <= A[0] || t; i++, t /= 10)
A[i] = (t += A[i] * B) % 10;
A[0] = i - 1;
}
int main()
{
int n,i,b;
A[0]=1; A[1]=1;
freopen("patrate2.in", "r",stdin);
freopen("patrate2.out", "w",stdout);
scanf("%d", &n);
b=n*n;
--b;
mul(A,2);
while (b>1)
if (b%2==1) { mul(A,2); --b;}
else { mul(A,4); b=b-2;}
for(i=1;i<=n;++i)
mul(A,i);
for(i=A[0];i>=1;--i)
printf("%d", A[i]);
return 0;
}