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;
#define int long long
#define OYY 1000000005
#define mod 998244353
#define faster ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define mid (start+end)/2
#define lim 200005
#define se second
#define fi first
int dizi[lim];
int32_t main(){
faster
int n;cin>>n;
vector<int> cev(n,0);
for(int i=0;i<n;i++){
cin>>dizi[i];
while((dizi[i]%2)==0){
cev[i]++;
dizi[i]/=2;
}
cev[i]=(1<<cev[i]);
if(i!=0)cev[i]+=cev[i-1];
}
//for(int i=0;i<n;i++)cout<<cev[i]<<" ";
int q;cin>>q;
while(q--){
int x;cin>>x;
int deg=lower_bound(cev.begin(),cev.end(),x)-cev.begin();
cout<<dizi[deg]<<'\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... |