This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <iostream>
using namespace std;
long long n, k;
long long getNum(long long pos, int p2, int seqPos)
{
    while(seqPos+(1LL<<(n-1-p2))<=pos)
    {
        seqPos += (1LL<<(n-1-p2));
        p2++;
    }
    if(pos==seqPos) return (1LL<<(p2-1));
    long long nextSeqPos = seqPos+(1LL<<(n-1-p2));
    long long diff = pos - seqPos;
    return getNum(nextSeqPos+diff, p2, seqPos) - (1<<p2);
}
int main()
{
    cin >> n >> k;
    if(k==1)
    {
        cout << "1" << '\n';
        return 0;
    }
    //for(int k = 1;k<=(1<<n);k++)
    cout << getNum(k, 0, 1) << '\n';
}
| # | Verdict | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict | Execution time | Memory | Grader output | 
|---|
| Fetching results... |