65 pts
查看原帖
65 pts
416242
New_hope楼主2022/10/23 17:33
#include<bits/stdc++.h>
using namespace std;
int main(){
	
	long long n,k,l,r;
	bool fl=0,fr=1;
	scanf("%lld%lld",&n,&k);
	l=0;
	r=pow(2,n)-1;
	for(long long i=1;i<=n;i++){
		long long mid=(l+r)/2;
		if(k>mid){
			cout << fr;
			fl = 1;
			fr = 0;
			l = mid+1;
		}
		else{
			cout << fl;
			fl = 0;
			fr = 1;
			r = mid;
		}
	}
	return 0;
}

2022/10/23 17:33
加载中...