Pagini recente » Cod sursa (job #3220689) | Cod sursa (job #2761598) | Cod sursa (job #885505) | Cod sursa (job #3249882) | Cod sursa (job #2328758)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("patrate2.in");
ofstream g("patrate2.out");
const int mod = 1999999973;
int Ridicare(int N, int P)
{
int r = 1;
while(P)
{
if(P % 2 == 1)
r = (1LL * r * N)%mod;
N = (1LL * N * N)%mod;
P = P / 2;
}
return r;
}
int Factorial(int x)
{
int p=1;
for(int i=1;i<x;i++)
{
p=p*i;
}
}
int main()
{int n;
f>>n;
int long long x=Factorial(n)*Ridicare(2,n*n);
g<<x;
return 0;
}