Pagini recente » Cod sursa (job #2529638) | Cod sursa (job #2488335) | Cod sursa (job #126316) | Cod sursa (job #2223124) | Cod sursa (job #827747)
Cod sursa(job #827747)
#include<stdio.h>
#include<fstream>
using namespace std;
#define MAXF 3500
typedef int Huge[ MAXF ];
int n, i;
Huge res;
inline void Mult(Huge a, int x)
{
int i, T = 0;
for(i = 1; i <= a[0]; ++i)
{
a[i] *= x;
a[i] += T;
T = a[i] / 10;
a[i] %= 10;
}
while(T)
++a[0], a[ a[0] ] = T % 10, T /= 10;
}
int main()
{
ifstream f("patrate2.in");
f >> n;
f.close();
res[0] = res[1] = 1;
for(i = 1; i <= n*n/3; ++i)
Mult(res, 8);
for(i = 1; i <= n*n%3; ++i)
Mult(res, 2);
for(i = 2; i <= n; ++i)
Mult(res, i);
FILE *g = fopen("patrate2.out", "w");
for(i = res[0]; i; --i)
fprintf(g, "%d", res[i]);
fprintf(g, "\n");
fclose(g);
return 0;
}