Submission #581013

#	Time	Username	Problem	Language	Result	Execution time	Memory
581013		pakapu	Rack (eJOI19_rack)	C++14	40 / 100	27 ms	11348 KiB

rack

#include <iostream>
#include <vector>
#include <numeric>
#include <algorithm>
#include <queue>
#include <bitset>
#include <math.h>

using namespace std;

const int MOD = 1e9 + 7;

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

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

    string s = bitset<10000000>(k - 1).to_string();

    reverse(s.begin(), s.end());

    long long pos = 1;
    for(int i = 0; i < n; i++) {
        if(s[i] == '1') {
            pos = (pos * 2) % MOD;
        }
        else {
            pos = (pos * 2 - 1) % MOD;
        }
    }

    cout << pos;


    return 0;
}

• Subtask 1: 20 / 20
• Subtask 2: 20 / 20
• Subtask 3: 0 / 60