Pagini recente » Cod sursa (job #1803519) | Cod sursa (job #3238083) | Cod sursa (job #3221902) | Cod sursa (job #2198272) | Cod sursa (job #3155479)
#include <fstream>
using namespace std;
int lgput(int n,int a) {
int rez=1;
while(a>0) {
if(a%2==1)
rez*=n;
n=n*n;
a/=2;
}
return rez;
}
void debugPrint(bool on=0) {
if(!on)
return;
//cout<<lgput(3,5)<<"\n";
}
int solve(int n) {
int sq=n*n,rez=lgput(2,sq);
for(int i=2; i<=n; i++)
rez*=i;
return rez;
}
int main() {
ifstream cin("patrate2.in");
ofstream cout("patrate2.out");
debugPrint();
int n;
cin>>n;
cout<<solve(n);
return 0;
}