Pagini recente » Rating Eugen Neagoe (eneagoe) | Cod sursa (job #342865) | Cod sursa (job #619804) | Cod sursa (job #159233) | Cod sursa (job #2787698)
#include <cstdio>
FILE *fin, *fout;
const int DIM = 10067;
const int base = 10;
const int POW = 20;
int n;
typedef int bignum[DIM + 1];
bignum ans;
void multiply(bignum c, bignum a, int b) {
long long T = 0;
c[0] = a[0];
for(int i = 1; i <= a[0]; i++) {
T += a[i] * b;
c[i] = T % base;
T /= base;
}
while(T) {
c[++c[0]] = T % base;
T /= base;
}
}
void put(bignum c, int a, int b) {
for(int i = 1; i <= b; i++) {
multiply(c, c, a);
}
}
void write(bignum a) {
fprintf(fout, "%d", a[a[0]]);
for(int i = a[0] - 1; i > 0; i--) {
for(int b = base; b / 10 > a[i]; b /= 10) {
fprintf(fout, "0");
}
fprintf(fout, "%d", a[i]);
}
}
int main() {
fin = fopen("patrate2.in", "r");
fout = fopen("patrate2.out", "w");
fscanf(fin, "%d", &n);
ans[0] = ans[1] = 1;
put(ans, (1 << POW), (n * n) / POW);
put(ans, 2, (n * n) % POW);
for(int i = 1; i <= n; i++) {
multiply(ans, ans, i);
}
write(ans);
return 0;
}