Cod sursa(job #894693)

Utilizator sebii_cSebastian Claici sebii_c Data 26 februarie 2013 22:59:37
Problema Patrate2 Scor 0
Compilator cpp Status done
Runda Arhiva de probleme Marime 0.3 kb
Raporteaza aceasta sursa 
#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()
{
    int n;
    scanf("%d", &n);

    factorial(n);
    printf("%lld\n", fact[n] * (1LL << (n * n)));

    return 0;
}