제출 #999705

#제출 시각아이디문제언어결과실행 시간메모리
999705vjudge1Rack (eJOI19_rack)C++17
40 / 100
1 ms348 KiB
#pragma GCC optimize("Ofast")
#include"bits/stdc++.h"

#define int long long

using namespace std;

const int md = 1e9 + 7;

signed main() {
    cin.tie(nullptr)->sync_with_stdio(false);

    int n, k;
    cin >> n >> k;

    k --;

    int r = 0;

    for (int i = 0; i < 61; i ++) {
        if (k & (1ll << i)) {
            (r += 1ll << (n - i - 1)) %= md;
        }
    }

    cout << (r + 1) % md << '\n';
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...