#include <bits/stdc++.h>
using namespace std;
#define int long long
int n,q;
int arr[(int)2e5+1];
int pref[(int)2e5+1];
int dab[(int)2e5+1];
signed main(){
cin>>n;pref[0]=0;
for(int i=1;i<=n;i++){
int x;cin>>x;
int c = 1;
while(!(x&1)){
c <<= 1;
x>>=1;
}
pref[i]=pref[i-1]+c;
dab[i]=x;
}
cin>>q;
//
// for(int i=0;i<=n;i++)cout<<pref[i]<<' ';cout<<'\n';
// for(int i=0;i<=n;i++)cout<<dab[i]<<' ';
while(q--){
int x;cin>>x;
int idx = lower_bound(pref+1,pref+n,x) - pref;
cout<<dab[idx]<<'\n';
}
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... |