# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
438660 | raid | Rack (eJOI19_rack) | C++17 | 1 ms | 292 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 <iostream>
#include <vector>
using namespace std;
const int MOD = 1e9 + 7;
vector<int> db;
int main() {
int n;
long long k;
cin >> n >> k;
--k;
while ( k ) {
db.push_back( k & 1 );
k >>= 1;
}
while ( db.size() != n ) {
db.push_back( 0 );
}
long long res = 0;
for ( int i = 0; i < n; ++i ) {
if ( db[i] ) {
res = (res + (1LL << (n - i - 1))) % MOD;
}
}
cout << (res + 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... |