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>
using namespace std;
int pow(int n)
{
long long t = 1;
for(int i = 1; i <= n; i++)
{
t *= 2;
t %= 1000000007;
}
return t;
}
int main()
{
int n, k;
cin >> n >> k;
k = k - 1;
long long ans = 0;
for(int i = 1; i <= n; i++)
{
if(k % 2 == 1)
{
ans += pow(n - i);
ans %= 1000000007;
}
k /= 2;
}
ans = ans + 1;
ans %= 1000000007;
cout << ans << '\n';
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |