Cod sursa(job #635642)
Utilizator | Data | 19 noiembrie 2011 13:46:55 | |
---|---|---|---|
Problema | Ciuperci | Scor | 0 |
Compilator | cpp | Status | done |
Runda | .com 2011 | Marime | 0.41 kb |
#include <stdio.h>
#define ll long long
int t;
ll n;
inline ll calcul(ll n)
{
if (n==0)
return 1;
if (n==1)
return 1;
if (n % 2==1)
return calcul(n/2)*calcul(n/2);
return 2*calcul(n/2)*calcul(n/2-1);
}
int main()
{
freopen("ciuperci.in","r",stdin);
freopen("ciuperci.out","w",stdout);
scanf("%d",&t);
while (t--)
{
scanf("%lld",&n);
printf("%lld\n",calcul(n));
}
return 0;
}