Bittijono

#include <iostream>
#include <vector>
#include <math.h>
 
using namespace std;
 
unsigned long k;
unsigned long in;
vector<unsigned long> n;
unsigned long max_i;
vector<short> byteline;
unsigned long size;
 
int main(){
	
	cin >> k;
	
	max_i = 0;
	for(unsigned long i = 0; i < k; i++){
		cin >> in;
		n.push_back(in);
		if(in > n[max_i]){
			max_i = i;
		}
	}
	
	byteline.push_back(0);
	for(unsigned long i = 0; i * log(2) < log(n[max_i]); i++){
		size = byteline.size();
		for(unsigned long j = 0; j < size; j++){
			byteline.push_back(-byteline[j]+1);
		}
	}
	
	for(unsigned long i = 0; i < n.size(); i++){
		cout << byteline[n[i] - 1] << endl;
	}
	
	return 0;
	
}

Test 1

Group: 1

Verdict: ACCEPTED

Test 2

Group: 2

Verdict: ACCEPTED

Test 3

Group: 3

Verdict: RUNTIME ERROR