95tps求调

63 998244353353442899

000101100110111010001010000101011111000111111100001010111000000

000101100110111010001010000101011111000111111100001010101111010

#include<bits/stdc++.h>
using namespace std;
unsigned long long n,k,cnt;
int main()
{
	std::ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	cin>>n>>k;
	for(int i=n;i>0;i--)
	{
		//cout<<i<<' '<<k<<endl;
		if(k<pow(2,i-1))
		{
			cout<<0;
		}
		else
		{
			cout<<1;
			k=pow(2,i-1)-1+pow(2,i-1)-k;
		}
	}
	return 0; 
}