Submission #70658348

---

Source Code Expand

#include <algorithm>
#include <iostream>
#include <vector>

#include <atcoder/all>


int main()
{
    using namespace std;
    using mint = atcoder::modint998244353;
    int n, m, l;
    cin >> n >> m >> l;
    vector<mint> f(n + 1);
    f[0] = 1;
    auto push = [&](int x) {
        for (int i = 0; i + x <= n; ++i) {
            f[i + x] += f[i];
        }
    };
    auto pop = [&](int x) {
        for (int i = n + 1 - x; i-- > 0;) {
            f[i + x] -= f[i];
        }
    };
    // mi == 1
    for (int x = 0; x < l; ++x) push(1 + x);
    cout << f[n].val() << '\n';
    for (int mi = 2; mi <= m - l + 1; ++mi) {
        pop(mi - 1);
        push(mi + l - 1);
        cout << f[n].val() << '\n';
    }
}

Submission Info

Judge Result