partition_function_2.test.cpp

#define PROBLEM "https://judge.yosupo.jp/problem/partition_function"

#include <iostream>

#include <atcoder/modint>
#include <atcoder/convolution>

#include "library/polynomial/formal_power_series.hpp"
#include "library/sequence/partition_number.hpp"

using mint = atcoder::modint998244353;

int main() {
    int n;
    std::cin >> n;
    auto f = suisen::partition_number<suisen::FormalPowerSeries<mint>>(n);
    for (int i = 0; i <= n; ++i) {
        std::cout << f[i].val() << " \n"[i == n];
    }
    return 0;
}