#include<bits/stdc++.h>
#define int long long
#define all(v) v.begin(), v.end()
#define SZ(x) (int)x.size()
#define pii pair<int, int>
#define X first
#define Y second
using namespace std;
const int maxn = 2e5 + 10;
const int mod = 1e9 + 7;// 998244353;
const int llmx = 1e18;
void sol(){
int n; cin >> n;
vector< pii > v(n);
for(auto &[k, cnt] : v){
cin >> k;
cnt = 1;
while(~k & 1){
k >>= 1;
cnt <<= 1;
}
}
int sum = 0, id = 0;;
int q; cin >> q;
while(q--){
int x; cin >> x;
while(sum + v[id].Y < x){
sum += v[id++].Y;
}
cout << v[id].X << "\n";
}
}
/*
4
14
9
8
12
6
2
3
5
7
11
13
// 7
// 9
// 1
// 1
// 1
// 3
*/
signed main(){
ios::sync_with_stdio(0), cin.tie(0), cerr.tie(0);
int t = 1; //cin >> t;
while(t--) sol();
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |