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 SPEED ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL);
#define int long long
#define endl "\n"
#define ALL(X) X.begin(), X.end()
const int sz = 10005, inf = 1e9;
vector<int>dp(sz);
void solve() {
int m, qq;
cin >> m >> qq;
vector<int> p(m);
for(int i = 0; i < m; i++) cin >> p[i];
dp[0] = 0;
for(int i = 1; i < sz; i++) dp[i] = inf;
for(int i = 1; i < sz; i++) {
int mini = inf;
for(int j = 0; j < m; j++) {
mini = min(mini, dp[i - (i % p[j])]);
}
dp[i] = mini + 1;
}
while(qq--) {
int q;
cin >> q;
if(dp[q] == inf + 1) {
cout << "oo" << endl;
}
else {
cout << dp[q] << endl;
}
}
}
signed main() {
SPEED;
int tst = 1;
// cin >> tst;
while(tst--) {
solve();
}
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |