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 INF 1000000000
using namespace std;
const int n = 10 * 1000 * 100;
int main() {
int m, q, x;
cin >> m >> q;
int prime[m];
for (int i = 0; i < m; ++i) {
cin >> prime[i];
}
int dp[n + 1];
dp[0] = 0;
for (int i = 1; i <= n; ++i) {
dp[i] = INF;
for (int j = 0; j < m; ++j) {
dp[i] = min(dp[i], 1 + dp[i - i % prime[j]]);
}
}
while (q--) {
cin >> x;
cout << (dp[x] < INF ? to_string(dp[x]) : "oo") << endl;
}
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... |