제출 #440383

#제출 시각아이디문제언어결과실행 시간메모리
440383stoyan_malininRack (eJOI19_rack)C++14
40 / 100
1 ms296 KiB
#include <iostream>
#include <vector>
#include <queue>
#include <set>

using namespace std;

const long long mod = 1e9 + 7;

long long revBits(long long x, int bitCnt)
{
    long long res = 0;
    for(int bit = 0;bit<bitCnt;bit++)
    {
        res += (((x>>bit)&1)<<(bitCnt-bit-1));
    }

    return res;
}

int main()
{
    long long n, k;
    cin >> n >> k;

    cout << (revBits(k-1, n) + 1)%mod << '\n';
}
/*
5 3
5 0 1 2 5
5 2 3
4 2 3
1 4 5

3 1
2 2 1
1 2 3
*/
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...