Bittijono

#include <iostream>
#include <math.h>
using namespace std;
 
int getBitti(long long luku, int bitti) {
  long long length = (long long) pow(2, ceil(log2(luku)));
  int bitit[2][2] = {0, 1, 1, 0};
  while (length > 2) {
    length /= 2;
    luku -= length;
    if (bitti == 0) {
      bitti = 1;
    }
    else {
      bitti = 0;
    }
    while (luku <= length / 2) {
      length /= 2;
    }
  }
  return bitit[bitti][luku - 1];
}
 
int main() {
  std::ios_base::sync_with_stdio(false);
 
  // long long amount, beginning, step;
  // cin >> amount >> beginning >> step;
  // for (long long i = beginning; i < (beginning + step * amount); i += step) {
  //   cout << i << " ";
  //   cout << getBitti(i, 0) << "\n";
  // }
 
  int amount;
  cin >> amount;
  for (int i = 0; i < amount; i++) {
    int luku;
    cin >> luku;
    cout << getBitti(luku, 0) << "\n";
  }
}

Test 1

Group: 1

Verdict: ACCEPTED

Test 2

Group: 2

Verdict: ACCEPTED

Test 3

Group: 3

Verdict: WRONG ANSWER