| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1352576 | opeleklanos | Rack (eJOI19_rack) | C++20 | 0 ms | 428 KiB |
#include <iostream>
using namespace std;
#define ll long long
#define MOD 1000000007
int main(void){
ll n, k;
cin>>n>>k;
k--;
ll l = 0, r = (1<<n) - 1;
while(l < r){
ll mid = (l+r)/2;
if(k % 2){
l = mid+1;
}
else{
r = mid;
}
k/=2;
}
cout<<(l+1) % MOD<<endl;
return 0;
}| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
