# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
764659 | Gabi88 | Rack (eJOI19_rack) | C++14 | 8 ms | 468 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
using namespace std;
#define LL long long
const LL mod = 1000000007;
LL n, k, br = 0, tmp = 1;
int main(){
ios_base::sync_with_stdio(false); cin.tie(0); cin >> n >> k; k--;
vector<bool> v={};
while(k > 0){ v.push_back(k%2); k /= 2; }
while(v.size() < n) v.push_back(0);
reverse(v.begin(), v.end());
for(int i=0; i<n; i++){
if (v[i]){ br += tmp; br %= mod; }
tmp *= 2; tmp %= mod;
}
cout << (br+1) % mod; return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |