Bittijono

#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;

string flip(string s)
{
	string out = "";
	for (std::size_t  i = 0; i < s.length(); i++)
	{
		if (s[i] == '0')
			out += '1';
		if (s[i] == '1')
			out += '0';
	}
	return out;
}

string bittijono = "0";

char hankiBitti(std::size_t paikka)
{
	if (bittijono.size() > paikka)
		return bittijono[paikka - 1];
	string out = "0";
	while(out.size() < paikka)
	{
		out += flip(out);
	}
	if (out.size() > bittijono.size())
		bittijono = out;
	return out[paikka - 1];
}

int main()
{
	int count;
	cin >> count;

	vector<int> n;

	while (count > 0)
	{
		int num;
		cin >> num;
		n.push_back(num);
		count--;
	}

	vector<int> b = n;

	std::sort(b.begin(), b.end());
	hankiBitti(b[b.size() - 1]);

	for (std::size_t  i = 0; i < n.size(); i++)
	{
		cout << hankiBitti(n[i]) << endl;
	}

	return 0;
}

Test 1

Group: 1

Verdict: ACCEPTED

Test 2

Group: 2

Verdict: ACCEPTED

Test 3

Group: 3

Verdict: TIME LIMIT EXCEEDED