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
const ll nx=1e4+5;
ll m, q, x, dp[nx];
vector<ll> p;
int main()
{
cin.tie(NULL)->sync_with_stdio(false);
cin>>m>>q;
for (int i=1; i<=m; i++) cin>>x, p.push_back(x);
for (int i=1; i<nx; i++) dp[i]=1e18;
for (int i=1; i<nx; i++) for (auto t:p) dp[i]=min(dp[i], dp[i-(i%t)]+1);
while (q--)
{
cin>>x;
if (dp[x]==1e18) cout<<"oo\n";
else cout<<dp[x]<<'\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... |