제출 #440420

#제출 시각아이디문제언어결과실행 시간메모리
440420stoyan_malininRack (eJOI19_rack)C++14
0 / 100
1084 ms204 KiB
#include <iostream> using namespace std; long long n, k; long long getNum(long long pos, int p2, long long 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) - (1LL<<p2); } int main() { cin >> n >> k; cout << getNum(k, 0, 1) << '\n'; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...