Bittijono

#include <iostream> //std::cin, std::cout
#include <math.h> // log2, floor
 
uint64_t which(uint64_t n){
    return floor(log2(n));
}
 
bool solve(uint64_t n){
    n--;
    uint64_t tries = 0;
    uint64_t p = which(n);
    while(1){
        tries++;
        
        n = n - pow(2, p);
 
        if ( n == 0 ){
            return tries % 2;
        }
        p = which(n);
    }
}
 
int main(){
    uint32_t len;
    std::cin >> len;
    uint64_t input[len];
    for(unsigned int x = 0;x < len; x++){
        std::cin >> input[x];
    }
    for(unsigned int x = 0;x < len; x++){
        std::cout << solve(input[x]) << "\n";
    }  
    return 0;    
}
 

Test 1

Group: 1

Verdict: ACCEPTED

Test 2

Group: 2

Verdict: ACCEPTED

Test 3

Group: 3

Verdict: WRONG ANSWER