# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
841807 | pera | Rack (eJOI19_rack) | C++17 | 1 ms | 548 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 int long long
const int mod = 1e9 + 7;
int exp(int x , int y){
int r = 1;
x %= mod;
while(y){
if(y & 1) r = r * x % mod;
x = x * x % mod;
y /= 2;
}
return r;
}
main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n , k;cin >> n >> k;
int ans = 0;
for(int i = 0;i < n;i ++){
if((1LL << i) >= k) break;
if((1LL << i) & (k - 1)){
ans = (ans + exp(2 , n - i - 1)) % mod;
}
}
cout << (ans + 1) % mod << endl;
}
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... |