递归

#include <iostream>
#include <cmath>

using namespace std;


void solve(unsigned long long n, unsigned long long k) {
	if (n == 0) return;
	unsigned long long t = pow(2, n - 1);
	if (k < t) {
		cout << '0';
		solve(n - 1, k);
	} else {
		cout << '1';
		solve(n - 1, t - (k + 1 - t));
	}
}

int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);

	unsigned long long n, k;
	cin >> n >> k;

	solve(n, k);
	return 0;
}