test/yosupo-judge/partition_function/main.test.cpp

• View this file on GitHub
• Last update: 2021-04-23 23:44:44+09:00
• Problem: https://judge.yosupo.jp/problem/partition_function
• Link: View error logs on GitHub Actions

Depends on

• Partition number (Enumerate $P(n, n)$) (Mylib/Combinatorics/partition_number_n.cpp)
• join function (Mylib/IO/join.cpp)
• Modint (Mylib/Number/Mint/mint.cpp)

Code

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

#include <iostream>
#include "Mylib/Combinatorics/partition_number_n.cpp"
#include "Mylib/IO/join.cpp"
#include "Mylib/Number/Mint/mint.cpp"

namespace hl = haar_lib;

using mint = hl::modint<998244353>;

int main() {
  int N;
  std::cin >> N;

  auto p = hl::partition_number_n<mint>(N);

  std::cout << hl::join(p.begin(), p.end()) << std::endl;

  return 0;
}

#line 1 "test/yosupo-judge/partition_function/main.test.cpp"
#define PROBLEM "https://judge.yosupo.jp/problem/partition_function"

#include <iostream>
#line 2 "Mylib/Combinatorics/partition_number_n.cpp"
#include <cmath>
#include <vector>

namespace haar_lib {
  template <typename T>
  std::vector<T> partition_number_n(int N) {
    std::vector<T> p(N + 1);

    p[0] = 1;

    for (int i = 1; i <= N; ++i) {
      int s = std::sqrt(1 + 24 * i);

      for (int j = 1; j <= (s + 1) / 6; ++j) {
        p[i] += p[i - j * (3 * j - 1) / 2] * (j % 2 ? 1 : -1);
      }

      for (int j = 1; j <= (s - 1) / 6; ++j) {
        p[i] += p[i - j * (3 * j + 1) / 2] * (j % 2 ? 1 : -1);
      }
    }

    return p;
  }
}  // namespace haar_lib
#line 3 "Mylib/IO/join.cpp"
#include <sstream>
#include <string>

namespace haar_lib {
  template <typename Iter>
  std::string join(Iter first, Iter last, std::string delim = " ") {
    std::stringstream s;

    for (auto it = first; it != last; ++it) {
      if (it != first) s << delim;
      s << *it;
    }

    return s.str();
  }
}  // namespace haar_lib
#line 3 "Mylib/Number/Mint/mint.cpp"
#include <utility>

namespace haar_lib {
  template <int32_t M>
  class modint {
    uint32_t val_;

  public:
    constexpr static auto mod() { return M; }

    constexpr modint() : val_(0) {}
    constexpr modint(int64_t n) {
      if (n >= M)
        val_ = n % M;
      else if (n < 0)
        val_ = n % M + M;
      else
        val_ = n;
    }

    constexpr auto &operator=(const modint &a) {
      val_ = a.val_;
      return *this;
    }
    constexpr auto &operator+=(const modint &a) {
      if (val_ + a.val_ >= M)
        val_ = (uint64_t) val_ + a.val_ - M;
      else
        val_ += a.val_;
      return *this;
    }
    constexpr auto &operator-=(const modint &a) {
      if (val_ < a.val_) val_ += M;
      val_ -= a.val_;
      return *this;
    }
    constexpr auto &operator*=(const modint &a) {
      val_ = (uint64_t) val_ * a.val_ % M;
      return *this;
    }
    constexpr auto &operator/=(const modint &a) {
      val_ = (uint64_t) val_ * a.inv().val_ % M;
      return *this;
    }

    constexpr auto operator+(const modint &a) const { return modint(*this) += a; }
    constexpr auto operator-(const modint &a) const { return modint(*this) -= a; }
    constexpr auto operator*(const modint &a) const { return modint(*this) *= a; }
    constexpr auto operator/(const modint &a) const { return modint(*this) /= a; }

    constexpr bool operator==(const modint &a) const { return val_ == a.val_; }
    constexpr bool operator!=(const modint &a) const { return val_ != a.val_; }

    constexpr auto &operator++() {
      *this += 1;
      return *this;
    }
    constexpr auto &operator--() {
      *this -= 1;
      return *this;
    }

    constexpr auto operator++(int) {
      auto t = *this;
      *this += 1;
      return t;
    }
    constexpr auto operator--(int) {
      auto t = *this;
      *this -= 1;
      return t;
    }

    constexpr static modint pow(int64_t n, int64_t p) {
      if (p < 0) return pow(n, -p).inv();

      int64_t ret = 1, e = n % M;
      for (; p; (e *= e) %= M, p >>= 1)
        if (p & 1) (ret *= e) %= M;
      return ret;
    }

    constexpr static modint inv(int64_t a) {
      int64_t b = M, u = 1, v = 0;

      while (b) {
        int64_t t = a / b;
        a -= t * b;
        std::swap(a, b);
        u -= t * v;
        std::swap(u, v);
      }

      u %= M;
      if (u < 0) u += M;

      return u;
    }

    constexpr static auto frac(int64_t a, int64_t b) { return modint(a) / modint(b); }

    constexpr auto pow(int64_t p) const { return pow(val_, p); }
    constexpr auto inv() const { return inv(val_); }

    friend constexpr auto operator-(const modint &a) { return modint(M - a.val_); }

    friend constexpr auto operator+(int64_t a, const modint &b) { return modint(a) + b; }
    friend constexpr auto operator-(int64_t a, const modint &b) { return modint(a) - b; }
    friend constexpr auto operator*(int64_t a, const modint &b) { return modint(a) * b; }
    friend constexpr auto operator/(int64_t a, const modint &b) { return modint(a) / b; }

    friend std::istream &operator>>(std::istream &s, modint &a) {
      s >> a.val_;
      return s;
    }
    friend std::ostream &operator<<(std::ostream &s, const modint &a) {
      s << a.val_;
      return s;
    }

    template <int N>
    static auto div() {
      static auto value = inv(N);
      return value;
    }

    explicit operator int32_t() const noexcept { return val_; }
    explicit operator int64_t() const noexcept { return val_; }
  };
}  // namespace haar_lib
#line 7 "test/yosupo-judge/partition_function/main.test.cpp"

namespace hl = haar_lib;

using mint = hl::modint<998244353>;

int main() {
  int N;
  std::cin >> N;

  auto p = hl::partition_number_n<mint>(N);

  std::cout << hl::join(p.begin(), p.end()) << std::endl;

  return 0;
}

Back to top page