Cod sursa(job #635906)
Utilizator | Data | 19 noiembrie 2011 15:32:41 | |
---|---|---|---|
Problema | Ciuperci | Scor | 30 |
Compilator | c | Status | done |
Runda | .com 2011 | Marime | 0.48 kb |
#include <stdio.h>
#define MOD 666013
long long count(long long n)
{
if (n == 0 || n == 1)
return 1;
if (n % 2 == 0)
return (2 * count(n/2) % MOD) * (count(n/2 - 1) % MOD);
else
return (count(n/2) % MOD) * (count(n/2) % MOD);
}
int main()
{
freopen("ciuperci.in", "r", stdin);
freopen("ciuperci.out", "w", stdout);
long long N;
int Q;
scanf("%d", &Q);
for ( ; Q; --Q) {
scanf("%lld", &N);
printf("%lld\n", count(N) % MOD);
}
return 0;
}