Pagini recente » Cod sursa (job #828292) | Cod sursa (job #2700951) | Cod sursa (job #1007519) | Cod sursa (job #2562432) | Cod sursa (job #3319249)
#include<bits/stdc++.h>
#pragma GCC optimize("Ofast,unroll-loops,inline")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#define fast ios_base::sync_with_stdio(0);f.tie(0);g.tie(0);
#define setinf(x) memset(x,0x3f3f3f3f,sizeof(x));
#define set0(x) memset(x,0,sizeof(x));
#define all(x) x.begin(),x.end()
#define pii pair<int,int>
#define INF 0x3f3f3f3f
#define vi vector<int>
#define ll long long
#define vll vector<ll>
#define pb push_back
#define fi first
#define se second
#define DD 100001
#define nl '\n'
using namespace std;
const string file="ciuperci";
ifstream f(file+".in");
ofstream g(file+".out");
//#define f cin
//#define g cout
const int mod=666013;
ll solve(ll n) {
if (n<=1) return 1;
ll x=(n-1)/2;
ll y=(n-1)-x;
ll xx=solve(x);
ll yy=solve(y);
if (x==y) return (xx*yy)%mod;
return (2*xx%mod)*yy%mod;
}
int main(){
int q;
f>>q;
while (q--) {
ll n;
f>>n;
g<<solve(n)<<"\n";
}
system("pause");
return 0;
}