# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1221547 | mayac | Rack (eJOI19_rack) | C++20 | 0 ms | 328 KiB |
#include <iostream>
#include <vector>
#include <queue>
using namespace std;
using ll=long long;
ll calc(ll n,ll k){
//cout<<n<<" "<<k<<"\n";
if(k==1)return 1;
ll p=0;
while((1<<p)<k)p++;
p--;
return (1<<(n-p-1))+calc(n,k-(1<<p));
}
int main(){
int n,k,add;
cin>>n>>k;
cout<<calc(n,k)<<"\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... |