Bittilista

#include <bits/stdc++.h>
using namespace std;

#define get(x, j) (x & (1 << (j)))

int main()
{
	vector<int> v;
	int n, k;
	cin >> n >> k;
	for (int i = 0; i < (1 << n); ++i) {
		int o1 = 0;
		int o2 = 0;
		for (int j = 1; j < n; ++j) {
			if (get(i, j) && !get(i,j-1)) ++o1;
			if (!get(i, j) && get(i,j-1)) ++o2;
		}
		if (o1 == o2) {
			v.push_back(i);
		}
	}
	sort(v.begin(), v.end());
	int x = v[k - 1];
	for (int j = n - 1; j >= 0; --j) {
		cout << !!get(x,j);
	}
	cout << "\n";
}

Test 1

Group: 1

Verdict: ACCEPTED

Test 2

Group: 1

Verdict: ACCEPTED

Test 3

Group: 1

Verdict: ACCEPTED

Test 4

Group: 1

Verdict: ACCEPTED

Test 5

Group: 1

Verdict: ACCEPTED

Test 6

Group: 2

Verdict: ACCEPTED

Test 7

Group: 2

Verdict: ACCEPTED

Test 8

Group: 2

Verdict: ACCEPTED

Test 9

Group: 2

Verdict: ACCEPTED

Test 10

Group: 2

Verdict: ACCEPTED

Test 11

Group: 3

Verdict: RUNTIME ERROR

Test 12

Group: 3

Verdict: RUNTIME ERROR

Test 13

Group: 3

Verdict: RUNTIME ERROR

Test 14

Group: 3

Verdict: RUNTIME ERROR

Test 15

Group: 3

Verdict: RUNTIME ERROR