제출 #538643

#제출 시각아이디문제언어결과실행 시간메모리
538643BenmathIntercastellar (JOI22_ho_t1)C++14
100 / 100
462 ms10740 KiB
#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 timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...