Pagini recente » Cod sursa (job #1521094) | Cod sursa (job #2194291) | Cod sursa (job #1348342) | Cod sursa (job #2637313) | Cod sursa (job #1222353)
#include <fstream>
#define DIMN 5005
using namespace std;
ifstream f("patrate2.in");
ofstream g("patrate2.out");
int S[DIMN];
int n;
void mult(int A[], int B) {
int t = 0, i;
for (i = 1; i <= A[0] || t; i++, t/=10)
A[i] = (t += A[i] * B) % 10;
A[0] = i - 1;
}
int main() {
f >> n;
S[0] = 1;
S[1] = 1;
for (int i = 1; i<=n; ++i)
mult(S,i);
int p = n*n;
for (int i=1; i<=p/20; ++i)
mult(S, (1<<20));
for (int i = 1; i<=p%20; ++i)
mult(S, 2);
for (int i = S[0]; i>=1; --i)
g << S[i];
return 0;
}