제출 #269754

#제출 시각아이디문제언어결과실행 시간메모리
269754JuliusMieliauskasRack (eJOI19_rack)C++14
40 / 100
1 ms384 KiB
#include <bits/stdc++.h>
 
using namespace std;
 
#define all(x) x.begin(), x.end()
#define vi vector<int>
#define vll vector<long long>
#define MOD 1000000007
#define endl '\n'
 
typedef long long ll;
 
void print(vi v){
    cout<<"Contents of vector:\n";
    for(auto x : v) cout<<x<<" ";
    cout<<endl<<endl;
}
 
void solve(){
    int n, k; cin>>n>>k;
 
    int l = 1, r = pow(2, n);
    while(true){
        if(r - l == 0) break;
 
        int mid = (r+l) / 2;
        //cout<<"l: "<<l<<"  r: "<<r<<"  mid: "<<mid<<endl;
        if(k%2){
            r = mid;
        } else {
            l = mid;
        }
 
        k = ceil(k*1.0 / 2.0);
    }
    cout<<r+1<<endl;
}
 
int main() {
    ios_base::sync_with_stdio(false); cin.tie(nullptr);
    //ifstream cin("input.txt"); ofstream cout("output.txt");///cia failai
 
    //int T; cin>>T;
    int T = 1;
 
    for(int it = 1; it<=T; it++){
        solve();
 
    }
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...