Submission #737096

#TimeUsernameProblemLanguageResultExecution timeMemory
737096tshabanov7Rack (eJOI19_rack)C++17
100 / 100
4 ms4064 KiB
#include <bits/stdc++.h>

using namespace std;
using ll = long long;

constexpr int MOD = 1E9 + 7;

int add(int a, int b) {
    a += b;
    return a >= MOD ? a - MOD : a;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int n;
    cin >> n;

    ll k;
    cin >> k;
    k--;

    vector<int> pow2(n);
    pow2[0] = 1;
    for (int i = 0; i < n - 1; i++) {
        pow2[i + 1] = add(pow2[i], pow2[i]);
    }

    int ans = 0;
    while (k > 0) {
        ans = add(ans, (k % 2) * pow2[--n]);
        k /= 2;
    }

    cout << ans + 1 << "\n";

    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...