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;
#define ll long long
long long m, q, pd=1, x, vl;
vector<ll> p;
int main()
{
cin.tie(NULL)->sync_with_stdio(false);
cin>>m>>q;
for (int i=1; i<=m; i++) cin>>x, pd=min((long long)10000005, pd*x), p.push_back(x);
while (q--)
{
cin>>vl;
long long tmp=vl/x*x, res=0;
for (auto t:p) if (vl-(vl%t)<tmp) res=1;
if (vl>=pd) cout<<"oo\n";
else cout<<2*(vl/x)+((vl%x)!=0)-res<<'\n';
}
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |