# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
929498 | 2024-02-18T05:59:52 Z | Chinguun | Rack (eJOI19_rack) | C++14 | 0 ms | 0 KB |
#include<bits/stdc++.h> using namespace std; #define int long long #define ff first #define ss second #define pb push_back #define meta int x = i * 2 + 1, y = x + 1, m = (L + R) / 2 const int N = 2e5 + 7; const int oo = 1e18; const int mod = 1e9 + 7; typedef pair<int, int> pii; typedef vector<int> vi; typedef vector<pii> vii; int query(int ans, int k) { if(k % 2 == 1) ans *= 2; else { ans *= 2; ans++; } return ans; } signed main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n, k; cin >> n >> k; cout << query(pw(2, n), k) << '\n'; return 0; }