简洁递归,60分求调qwq
查看原帖
简洁递归,60分求调qwq
1340302
jijianxiangsu楼主2024/10/23 16:10
#include<bits/stdc++.h>
#include<cstdio>
using namespace std;
#define int unsigned long long

void f(int n,int k){
	if(n==1){
		if(k==1) cout<<"0";
		else cout<<"1";
		return;
	}		
	if(k<=(1<<(n-1))){cout<<"0";f(n-1,k);}
	else{cout<<"1";f(n-1,(1<<n)-k+1);}
}

signed main(){
//	freopen("t.in","r",stdin);
//	freopen("t.ans","w",stdout);
	int n,k;
	cin>>n>>k;
	k+=1;
	f(n,k);
	//cout<<f(n,k)<<"\n";
	cout<<"\n";
}
2024/10/23 16:10
加载中...