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;
int i, j, k;
void narrow (int lower, int upper)
{
if (k % 2 == 0)
{
lower = (upper + lower) / 2 + 1;
k /= 2;
}
else
{
upper = (upper + lower) / 2;
k /= 2;
k++;
}
i = lower;
j = upper;
}
int main()
{
int n;
cin >> n >> k;
i = 1;
j = pow(2, n);
while (j != i)
{
narrow(i, j);
}
cout << i;
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... |