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()
{
int N;
cin >> N;
vector<long long> value(N);
vector<long long> len(N, 1);
for (int i = 0; i < N; i++)
{
cin >> value[i];
while (value[i] % 2 == 0)
{
value[i] /= 2;
len[i] *= 2;
}
}
for (int i = 1; i < N; i++)
{
len[i] += len[i - 1];
}
int Q;
cin >> Q;
for (int i = 0; i < Q; i++)
{
int x;
cin >> x;
int j = 0;
while (x > len[j])
{
j++;
}
cout << value[j] << endl;
}
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |