# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
532587 | PsiolixUK | Rack (eJOI19_rack) | C++14 | 1 ms | 312 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;
using ll = long long;
constexpr int MOD = 1e9 + 7;
main()
{
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int n, k;
int pow = 1;
int odp = 1;
cin >> n >> k;
--k;
for(int i = 0; i < n; ++i)
{
if(k%2)
{
odp = (2 * odp + 1) % MOD;
}
else
{
odp = (2 * odp) % MOD;
}
k /= 2;
}
for(int i = 0; i < n; ++i)
pow = ((ll)pow * 2) % MOD;
cout << (odp - pow + 1 + MOD) % MOD;
}
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... |