Submission #929465

#	Time	Username	Problem	Language	Result	Execution time	Memory
929465		hngr	Rack (eJOI19_rack)	C++14	0 / 100	1041 ms	348 KiB

rack

#include <iostream>
#include <vector>
#include <set>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <string>
#define int long long 
const int mod = 1e9+7;
using namespace std;
int32_t main() {
    int n, k; cin >> n >> k;
    vector<int> y(n+1, 1);
    for(int i = 1; i <= n; i ++) y[i] = y[i-1] * 2;
    int ind = k;
    ind --;
    int ans = 1;
    while(ind != 0){
        (ans += (y[n-ind-1] % mod)) %= mod;
        ind -= y[ind];
    }
    cout << ans;
    return 0;
}

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