# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
648159 | baibhav26062008 | Intercastellar (JOI22_ho_t1) | C++14 | 0 ms | 0 KiB |
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;
int A[N];
for (int i=0; i<N; i++) {
cin >> A[i];
}
int Q; cin>>Q;
int X[Q];
for (int i=0; i<Q; i++) {
cin >> X[i];
}
vector<int>L;
for (int i = 0; i < N; i++) {
int curr = A[i];
int ctr = 0;
while (curr % 2 == 0) {
curr /= 2;
}
if (A[i] % 2 != 0) L.push_back(curr);
else { for (int j = 0; j < (A[i]/curr); j++) {
L.push_back(curr);
}
// (aL.push_back(curr);
}
}
// (it x : L) cout << x <<
for (int i = 0; i < Q; i++) {
cout << L[X[i]-1] << endl;
}
}