Submission #440384

# Submission time Handle Problem Language Result Execution time Memory
440384 2021-07-02T08:19:24 Z stoyan_malinin Rack (eJOI19_rack) C++14
40 / 100
1 ms 204 KB
#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)&1LL)<<(bitCnt-bit-1));
        res %= mod;
    }

    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 time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Incorrect 0 ms 204 KB Output isn't correct
13 Halted 0 ms 0 KB -