Pagini recente » Cod sursa (job #2080559) | Cod sursa (job #1030943) | Cod sursa (job #1728502) | Cod sursa (job #382272) | Cod sursa (job #157882)
Cod sursa(job #157882)
#include <stdio.h>
int A[1020];
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;
/*while (b!=0)
if (b%2==1) { rez=(rez*a)%c; b=b-1;}
else { a=(a*a)%c; b=b/2;} */
for(i=1;i<=b;++i)
mul(A,2);
for(i=1;i<=n;++i)
mul(A,i);
for(i=A[0];i>=1;--i)
printf("%d", A[i]);
//for(i=rez[0];i>=1;--i)
// printf("%d", rez[i]);
return 0;
}
//2^(N*N)*N!