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(){
int n;
cin>>n;
long long int arr[n];
long long int a[n],b[n];
for(int i=0;i<n;i++){
cin>>arr[i];
long long int bro=1;
while(arr[i]%2==0){
bro=bro*2;
arr[i]=arr[i]/2;
}
a[i]=arr[i];
b[i]=bro;
// cout<<a[i]<<" "<<b[i]<<endl;
}
int q;
cin>>q;
int i=0;
long long int sum=1;
while(q--){
long long int x;
cin>>x;
int t1=0;
while(t1==0){
if((sum+b[i])<=x){
sum=sum+b[i];
i++;
}else{
break;
}
}
cout<<a[i]<<endl;
}
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |