Bittijono

#include <iostream>
#include <cstdio>
#include <math.h>

using namespace std;

unsigned int which(unsigned long long int n){
    unsigned long int p = 1;
    while(1){
        if(n >= pow(2,p)){
            p++;
            continue;
        } 
        p--;
        break;
    }
    return p;
}

unsigned char solve(unsigned long long int n){
    n--;
    unsigned int tries = 0;
    unsigned int p = which(n);
    while(1){
        tries++;
        
        n = n - pow(2, p);

        if ( n == 0 ){
            return tries % 2;
        }
        p = which(n);
    }
}

int main(){
    unsigned long int len;
    cin >> len;

    unsigned long long int n[len];
    for(unsigned int x = 0;x < len; x++){
        cin >> n[x];
    }

    unsigned char o[len];
    for(unsigned int x = 0;x < len; x++){
        o[x] = solve(n[x]);
    }  

    for(unsigned int x = 0;x < len; x++){
        printf("%d\n",o[x]);
    }
    
    return 0;    
}

Test 1

Group: 1

Verdict: ACCEPTED

Test 2

Group: 2

Verdict: ACCEPTED

Test 3

Group: 3

Verdict: TIME LIMIT EXCEEDED