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;
const long long d = 1e9+7;
vector <long long> t;
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long n,k,w=1;
cin>>n>>k;
t.resize(n);
t[0]=1;
for (int i=1; i<n; i++)
t[i]=(t[i-1]*2)%d;
for (int i=n-1; i>=0; i--)
{
if (k%2==0)
{
w+=t[i];
w=w%d;
}
else
{
k++;
}
k/=2;
}
cout<<w;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |