Pagini recente » Cod sursa (job #2284788) | Cod sursa (job #1724713) | Cod sursa (job #134820) | Cod sursa (job #148838) | Cod sursa (job #983425)
Cod sursa(job #983425)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("patrate2.in");
ofstream fout("patrate2.out");
long n, h[5000];
const long p2 = (1 << 12);
inline void Mul(long x)
{
long t = 0;
for(int i=1; i<=h[0]; i++)
{
h[i] = h[i] * x + t;
t = h[i] / 10;
h[i] %= 10;
}
while(t)
{
h[++h[0]] = t % 10;
t /= 10;
}
}
int main()
{
fin>>n;
h[0] = h[1] = 1;
for(int i=1; i<=n; i++)
Mul(i);
for(int i=1; i<=n; i++)
{
long p = 1;
for(int j=1; j<=n; j++)
{
p *= 2;
if(p == p2) Mul(p2), p = 1;
}
Mul(p);
}
for(int i=h[0]; i>0; i--)
fout<<h[i];
return 0;
}