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 * 1000;
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;
    int updated[m];
    fill(updated, updated + m, 0);
    vector<int> current[n + 1];
    for (int i = 0; i < m; ++i) {
        for (int j = 1; prime[i] * j <= n; ++j) {
            current[prime[i] * j].push_back(i);
        }
    }
    for (int i = 1; i <= n; ++i) {
        for (int pIdx : current[i]) {
            updated[pIdx] = i;
        }
        int bestVal = INF;
        for (int j = 0; j < m; ++j) {
            bestVal = min(bestVal, updated[j]);
        }
        if (bestVal >= i) dp[i] = INF;
        else dp[i] = 1 + dp[bestVal];
    }
    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... |