Pagini recente » Borderou de evaluare (job #2912787) | Clasamentul arhivei educationale | Cod sursa (job #2617965) | Clasamentul arhivei educationale | Cod sursa (job #635647)
Cod sursa(job #635647)
#include <stdio.h>
#define ll long long
#define MOD 666013
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))%MOD;
return (calcul(n/2)*calcul(n/2-1)*2)%MOD;
}
int main()
{
freopen("ciuperci.in","r",stdin);
freopen("ciuperci.out","w",stdout);
scanf("%d",&t);
while (t--)
{
scanf("%lld",&n);
printf("%d\n",calcul(n));
}
return 0;
}