Pagini recente » Cod sursa (job #1356334) | Cod sursa (job #1369160) | Cod sursa (job #1464403) | Cod sursa (job #2761383) | Cod sursa (job #82124)
Cod sursa(job #82124)
#include <iostream>
const int maxn = 2000;
const int base = 1000000;
FILE *in = fopen("patrate2.in","r"), *out = fopen("patrate2.out","w");
int N;
int H[maxn];
void mul(int A[], int B)
{
int i, t = 0;
for (i = 1; i <= A[0] || t; i++, t /= base)
A[i] = (t += A[i] * B) % base;
A[0] = i - 1;
}
int main()
{
fscanf(in, "%d", &N);
H[0] = 1;
H[1] = 2;
int end = N*N;
for ( int i = 1; i < end; ++i )
mul(H, 2);
for ( int i = 2; i <= N; ++i )
mul(H, i);
for ( int i = H[0]; i; --i )
fprintf(out, "%d", H[i]);
fprintf(out, "%d", base);
return 0;
}