This documentation is automatically generated by online-judge-tools/verification-helper
View the Project on GitHub ebi-fly13/Library
#include "fps/sum_of_rational_fps.hpp"
$\sum_{i = 0}^{n-1} \frac{f_i}{g_i}$ を $O(N(\log N)^2)$ で計算する。
#pragma once #include <algorithm> #include <vector> #include "../fps/fps.hpp" #include "../modint/base.hpp" namespace ebi { template <Modint mint> std::pair<FormalPowerSeries<mint>, FormalPowerSeries<mint>> sum_of_rational_fps( std::vector<std::pair<FormalPowerSeries<mint>, FormalPowerSeries<mint>>> fs) { if (fs.empty()) { return {{0}, {1}}; } using FPS = FormalPowerSeries<mint>; using P = std::pair<FPS, FPS>; auto add = [&](const P &a, const P &b) -> P { return {a.first * b.second + a.second * b.first, a.second * b.second}; }; int i = 0; while (i + 1 < (int)fs.size()) { fs.emplace_back(add(fs[i], fs[i + 1])); i += 2; } return fs.back(); } } // namespace ebi
#line 2 "fps/sum_of_rational_fps.hpp" #include <algorithm> #include <vector> #line 2 "fps/fps.hpp" #line 4 "fps/fps.hpp" #include <cassert> #include <optional> #line 7 "fps/fps.hpp" #line 2 "modint/base.hpp" #include <concepts> #include <iostream> #include <utility> namespace ebi { template <class T> concept Modint = requires(T a, T b) { a + b; a - b; a * b; a / b; a.inv(); a.val(); a.pow(std::declval<long long>()); T::mod(); }; template <Modint mint> std::istream &operator>>(std::istream &os, mint &a) { long long x; os >> x; a = x; return os; } template <Modint mint> std::ostream &operator<<(std::ostream &os, const mint &a) { return os << a.val(); } } // namespace ebi #line 9 "fps/fps.hpp" namespace ebi { template <Modint mint> struct FormalPowerSeries : std::vector<mint> { private: using std::vector<mint>::vector; using std::vector<mint>::vector::operator=; using FPS = FormalPowerSeries; public: FormalPowerSeries(const std::vector<mint> &a) { *this = a; } FPS operator+(const FPS &rhs) const noexcept { return FPS(*this) += rhs; } FPS operator-(const FPS &rhs) const noexcept { return FPS(*this) -= rhs; } FPS operator*(const FPS &rhs) const noexcept { return FPS(*this) *= rhs; } FPS operator/(const FPS &rhs) const noexcept { return FPS(*this) /= rhs; } FPS operator%(const FPS &rhs) const noexcept { return FPS(*this) %= rhs; } FPS operator+(const mint &rhs) const noexcept { return FPS(*this) += rhs; } FPS operator-(const mint &rhs) const noexcept { return FPS(*this) -= rhs; } FPS operator*(const mint &rhs) const noexcept { return FPS(*this) *= rhs; } FPS operator/(const mint &rhs) const noexcept { return FPS(*this) /= rhs; } FPS &operator+=(const FPS &rhs) noexcept { if (this->size() < rhs.size()) this->resize(rhs.size()); for (int i = 0; i < (int)rhs.size(); ++i) { (*this)[i] += rhs[i]; } return *this; } FPS &operator-=(const FPS &rhs) noexcept { if (this->size() < rhs.size()) this->resize(rhs.size()); for (int i = 0; i < (int)rhs.size(); ++i) { (*this)[i] -= rhs[i]; } return *this; } FPS &operator*=(const FPS &); FPS &operator/=(const FPS &rhs) noexcept { int n = deg() - 1; int m = rhs.deg() - 1; if (n < m) { *this = {}; return *this; } *this = (*this).rev() * rhs.rev().inv(n - m + 1); (*this).resize(n - m + 1); std::reverse((*this).begin(), (*this).end()); return *this; } FPS &operator%=(const FPS &rhs) noexcept { *this -= *this / rhs * rhs; shrink(); return *this; } FPS &operator+=(const mint &rhs) noexcept { if (this->empty()) this->resize(1); (*this)[0] += rhs; return *this; } FPS &operator-=(const mint &rhs) noexcept { if (this->empty()) this->resize(1); (*this)[0] -= rhs; return *this; } FPS &operator*=(const mint &rhs) noexcept { for (int i = 0; i < deg(); ++i) { (*this)[i] *= rhs; } return *this; } FPS &operator/=(const mint &rhs) noexcept { mint inv_rhs = rhs.inv(); for (int i = 0; i < deg(); ++i) { (*this)[i] *= inv_rhs; } return *this; } FPS operator>>(int d) const { if (deg() <= d) return {}; FPS f = *this; f.erase(f.begin(), f.begin() + d); return f; } FPS operator<<(int d) const { FPS f = *this; f.insert(f.begin(), d, 0); return f; } FPS operator-() const { FPS g(this->size()); for (int i = 0; i < (int)this->size(); i++) g[i] = -(*this)[i]; return g; } FPS pre(int sz) const { return FPS(this->begin(), this->begin() + std::min(deg(), sz)); } FPS rev() const { auto f = *this; std::reverse(f.begin(), f.end()); return f; } FPS differential() const { int n = deg(); FPS g(std::max(0, n - 1)); for (int i = 0; i < n - 1; i++) { g[i] = (*this)[i + 1] * (i + 1); } return g; } FPS integral() const { int n = deg(); FPS g(n + 1); g[0] = 0; if (n > 0) g[1] = 1; auto mod = mint::mod(); for (int i = 2; i <= n; i++) g[i] = (-g[mod % i]) * (mod / i); for (int i = 0; i < n; i++) g[i + 1] *= (*this)[i]; return g; } FPS inv(int d = -1) const { int n = 1; if (d < 0) d = deg(); FPS g(n); g[0] = (*this)[0].inv(); while (n < d) { n <<= 1; g = (g * 2 - g * g * this->pre(n)).pre(n); } g.resize(d); return g; } FPS log(int d = -1) const { assert((*this)[0].val() == 1); if (d < 0) d = deg(); return ((*this).differential() * (*this).inv(d)).pre(d - 1).integral(); } FPS exp(int d = -1) const { assert((*this)[0].val() == 0); int n = 1; if (d < 0) d = deg(); FPS g(n); g[0] = 1; while (n < d) { n <<= 1; g = (g * (this->pre(n) - g.log(n) + 1)).pre(n); } g.resize(d); return g; } FPS pow(long long k, int d = -1) const { assert(k >= 0); int n = deg(); if (d < 0) d = n; if (k == 0) { FPS f(d); if (d > 0) f[0] = 1; return f; } int low = d; for (int i = n - 1; i >= 0; i--) if ((*this)[i] != 0) low = i; if (low >= (d + k - 1) / k) return FPS(d, 0); int offset = k * low; mint c = (*this)[low]; FPS g(d - offset); for (int i = 0; i < std::min(n - low, d - offset); i++) { g[i] = (*this)[i + low]; } g /= c; g = g.pow_1(k); return (g << offset) * c.pow(k); } FPS pow_1(mint k, int d = -1) const { assert((*this)[0] == 1); return ((*this).log(d) * k).exp(d); } FPS pow_newton(long long k, int d = -1) const { assert(k >= 0); const int n = deg(); if (d < 0) d = n; if (k == 0) { FPS f(d); if (d > 0) f[0] = 1; return f; } for (int i = 0; i < n; i++) { if ((*this)[i] != 0) { mint rev = (*this)[i].inv(); FPS f = (((*this * rev) >> i).log(d) * k).exp(d); f *= (*this)[i].pow(k); f = (f << (i * k)).pre(d); if (f.deg() < d) f.resize(d); return f; } if (i + 1 >= (d + k - 1) / k) break; } return FPS(d); } int deg() const { return (*this).size(); } void shrink() { while ((!this->empty()) && this->back() == 0) this->pop_back(); } int count_terms() const { int c = 0; for (int i = 0; i < deg(); i++) { if ((*this)[i] != 0) c++; } return c; } std::optional<FPS> sqrt(int d = -1) const; static FPS exp_x(int n) { FPS f(n); mint fact = 1; for (int i = 1; i < n; i++) fact *= i; f[n - 1] = fact.inv(); for (int i = n - 1; i >= 0; i--) f[i - 1] = f[i] * i; return f; } void fft(); void ifft(); }; } // namespace ebi #line 8 "fps/sum_of_rational_fps.hpp" namespace ebi { template <Modint mint> std::pair<FormalPowerSeries<mint>, FormalPowerSeries<mint>> sum_of_rational_fps( std::vector<std::pair<FormalPowerSeries<mint>, FormalPowerSeries<mint>>> fs) { if (fs.empty()) { return {{0}, {1}}; } using FPS = FormalPowerSeries<mint>; using P = std::pair<FPS, FPS>; auto add = [&](const P &a, const P &b) -> P { return {a.first * b.second + a.second * b.first, a.second * b.second}; }; int i = 0; while (i + 1 < (int)fs.size()) { fs.emplace_back(add(fs[i], fs[i + 1])); i += 2; } return fs.back(); } } // namespace ebi