제출 #809115

#제출 시각아이디문제언어결과실행 시간메모리
809115ThylOneRack (eJOI19_rack)C++14
40 / 100
1 ms300 KiB
#include<bits/stdc++.h>

using namespace std;
const int MOD = 1000000007;
signed main(){
	int n,k;cin>>n>>k;
	long long inf = 1;
	long long sup = (1<<n);
	k--;
	for(int i=0;i<min(n,60);i++){
		int mid = (sup+inf)/2;
		
		if((k>>i)&1){
			//right
			inf = mid+1;
		}else{
			//left
			sup=mid;
		}
		
	}
	cout<<inf%MOD<<endl;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...