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 main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
int64_t pk[n],a[n];
for(int i = 0;i < n;++i)
{
cin >> a[i];
pk[i] = 1;
while(a[i]%2 == 0)
{
a[i]/=2;
pk[i] *= 2;
}
pk[i] += (i == 0 ? 0 : pk[i-1]);
}
int q;
cin >> q;
while(q--)
{
int64_t x;
cin >> x;
cout << a[lower_bound(pk,pk+n,x)-pk] << "\n";
}
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |