Pagini recente » Cod sursa (job #1658465) | Cod sursa (job #2858095) | Cod sursa (job #1921897) | Cod sursa (job #2868022) | Cod sursa (job #2328801)
#include <iostream>
#include <fstream>
using namespace std;
long long factorial(int n)
{
long long rez=1;
for (int i=1;i<=n;i++)
rez=rez*i;
return rez;
}
long long putere(int n)
{
long long r=1;
for (int i=0; i<n*n; i++)
{
r=r*2;
}
return r;
}
int main()
{
ifstream f("patrate2.in");
ofstream g("patrate2.out");
int n;
f>>n;
g<<factorial(n)*putere(n);
return 0;
}