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>
#define fi first
#define se second
using namespace std;
const int N=2e5;
int tab[N+10];
int ans[N+10];
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n,q;
cin>>n;
for(int i=1;i<=n;i++)
cin>>tab[i];
cin>>q;
long long cnt=0;
int k=0;
for(int i=1;i<=q;i++)
{
long long x;
cin>>x;
while(cnt<x)
{
k++;
long long c=1;
while(tab[k]%2==0)
{
tab[k]/=2;
c*=2;
}
cnt+=c;
}
cout<<tab[k]<<"\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... |