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 f first
#define s second
using namespace std;
#define int long long
signed main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int tt = 1;
//cin >> tt;
while(tt--) {
int n;
cin >> n;
vector<int> a(n);
for(int i = 0;i < n;i++)
cin >> a[i];
vector<int> b(n), c(n);
for(int i = 0;i < n;i++) {
int x = a[i];
while(x % 2 == 0)
x /= 2;
b[i] = a[i] / x;
c[i] = x;
}
vector<int> p(n);
p[0] = b[0];
for(int i = 1;i < n;i++)
p[i] = p[i - 1] + b[i];
int q;
cin >> q;
for(int i = 1;i <= q;i++) {
int x;
cin >> x;
auto u = lower_bound(p.begin(), p.end(), x) - p.begin();
cout << c[u] << "\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... |