제출 #1344657

#제출 시각아이디문제언어결과실행 시간메모리
1344657uranhishigRack (eJOI19_rack)C++20
40 / 100
1 ms344 KiB
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int mod = 1e9+7;

int run(int n, int k) {
    if (n == 0) return 1; 
    int x = (1 << (n-1))%mod; 
    if (k <= x) {
        return (run(n-1, k) * 2 - 1)%mod; 
    } 
    else {
        return (run(n-1, k - x) * 2)%mod;
    }
}

signed main() {
    int n, k;
    cin >> n >> k;
    cout << run(n, k)%mod;
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...