제출 #1306788

#제출 시각아이디문제언어결과실행 시간메모리
1306788yus1f_mRack (eJOI19_rack)C++20
0 / 100
1 ms832 KiB
#pragma GCC optimize("O3") #include <bits/stdc++.h> #define ll long long #define str string #define pb push_back #define pf push_front #define in insert #define all(v) v.begin(),v.end() const int sz=1000000,INF=1000000000; using namespace std; void solve() { ll n,m,num; cin>>n>>m; vector<ll>nums; num=pow(2,n); for(int i=1;i<=num/2;i+=2) { nums.pb(i),nums.pb(i+num/2); } for(int i=2;i<=num/2;i+=2) { nums.pb(i),nums.pb(i+num/2); } cout<<nums[m-1]; } int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr),cout.tie(nullptr); ll t=1; //cin>>t; while(t--) { solve(); } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...