Submission #5024648

---

Source Code Expand

#include <bits/stdc++.h>
 
using namespace std;

using ll = long long;
 
int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    ll n;
    int q;
    cin >> n >> q;
    vector<int> a(q);
    for (int i = 0; i < q; i++) {
        cin >> a[i];
    }
    
    set<ll> v;
    v.insert(1);
    for (int i = q - 1; i >= 0; i--) {
        set<ll> nv;
        for (ll x : v) {
            if (x % a[i] != 0) nv.insert(x);
            x *= a[i];
            if (x <= n) nv.insert(x);
        }
        v = move(nv);
    }
    cout << v.size() << endl;
    return 0;
}

Submission Info

Judge Result