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(0); cin.tie(0);
int n, q;
cin >> n;
int a[n];
for(int i=0; i<n; i++) cin >> a[i];
vector<pair<long long, long long> > v;
v.push_back(make_pair(0, 0));
for(int i=0; i<n; i++) {
long long x = a[i], count = 0;
while(x%2==0) {
x/=2;
count++;
}
long long m = (long long)1<<count;
v.push_back(make_pair(v.back().first+m, x));
}
cin >> q;
while(q--) {
long long x;
cin >> x;
int ans = upper_bound(v.begin(), v.end(), make_pair((long long)x, (long long)0)) - v.begin();
cout << v[ans].second << '\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... |