Submission #848081

---

Source Code Expand

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

const int N = (int) 1e5 + 7;
long long q[N];
long long res[N];

int main() {
    ios::sync_with_stdio(false);
    int n; cin >> n;
    int nq; cin >> nq;
    for (int i = 0; i < nq; ++i) cin >> q[i];
    vector<long long> v (1, n);
    for (int i = 0; i < nq; ++i) {
        while (!v.empty() && q[i] <= v.back()) v.pop_back();
        v.push_back(q[i]);
    }
    vector<long long> cnt (v.size());
    cnt.back() = 1;
    for (int i = (int) v.size() - 1; i >= 0; --i) {
        long long l = v[i];
        while (l > v[0]) {
            int p = lower_bound(v.begin(), v.end(), l) - v.begin() - 1;
            cnt[p] += l / v[p] * cnt[i];
            l %= v[p];
        }
        res[l] += cnt[i];
    }
    for (int i = n - 1; i > 0; --i) res[i] += res[i + 1];
    for (int i = 1; i <= n; ++i) cout << res[i] << '\n';
    return 0;
}

Submission Info

Judge Result