# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
369958 | iliccmarko | Rack (eJOI19_rack) | C++14 | 8 ms | 8192 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
#define endl "\n"
#define INF 1000000000
#define LINF 1000000000000000LL
#define pb push_back
#define all(x) x.begin(), x.end()
#define len(s) (int)s.size()
#define test_case { int t; cin>>t; while(t--)solve(); }
#define single_case solve();
#define line cerr<<"----------"<<endl;
#define ios { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); cerr.tie(NULL); }
#define mod 1000000007LL
const int N = 1e6 + 60;
ll n, k;
ll a[N];
int main()
{
a[0] = 1LL;
for(int i = 1;i<N;i++) a[i] = (a[i-1]*2LL)%mod;
ios
cin>>n>>k;
ll stepen = 2LL;
ll ind = n-1LL;
ll l = 1LL;
int par = 0;
while(k%stepen==0)
{
l = (l+a[ind])%mod;
ind--;
stepen*=2LL;
}
ind--;
stepen*=2LL;
while(stepen<=k)
{
ll aa = k%(stepen);
ll b = aa + stepen/2LL;
if(b>=stepen) b = aa - stepen/2LL;
b = max(b, aa);
if(k%stepen==b) l = (l+a[ind])%mod;
ind--;
stepen*=2LL;
}
cout<<l;
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... |