#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';
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Execution timed out |
1084 ms |
204 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Execution timed out |
1084 ms |
204 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Execution timed out |
1084 ms |
204 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |