# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
532711 | 2022-03-03T16:46:37 Z | miandry | Rack (eJOI19_rack) | C++14 | 0 ms | 0 KB |
#include <bits/stdc++.h> using namespace std; const int MOD = 1e9 + 7; int main() { ios_base::sync_with_stdio(0), cin.tie(0); int n; long long k; cin >> n >> k; --k; int wynik = 1; for (int i = 1; i <= n; ++i) { if (k % 2 == 0) wynik = ((long long)2wynik) % MOD; else wynik = ((long long)2wynik + 1) % MOD; k /= 2; } int pow2 = 1; for (int i = 1; i <= n; ++i) pow2 = ((long long)2*pow2) % MOD; cout << (wynik - (pow2 - 1) + MOD) % MOD << '\n'; return 0; }