Pagini recente » Cod sursa (job #1198555) | Cod sursa (job #2472163) | Cod sursa (job #2707273) | Cod sursa (job #2544429) | Cod sursa (job #894696)
Cod sursa(job #894696)
#include <cstdio>
const int MAXN = 101;
long long fact[MAXN];
void factorial(int n)
{
fact[0] = 1;
for (int i = 1; i <= n; ++i)
fact[i] = i * fact[i - 1];
}
int main()
{
freopen("patrate2.in", "r", stdin);
freopen("patrate2.out", "w", stdout);
int n;
scanf("%d", &n);
factorial(n);
printf("%lld\n", fact[n] * (1LL << (n * n)));
return 0;
}