Subproduct Tree (math/fps/subproduct-tree.hpp)

• View this file on GitHub
• Last update: 2024-05-01 23:44:47+09:00
• Include: #include "math/fps/subproduct-tree.hpp"

Required by

• Multipoint Evaluation (math/fps/multipoint-evaluation.hpp)
• Polynomial Interpolation(多項式補間) (math/fps/polynomial-interpolation.hpp)

Verified with

• test/verify/yosupo-multipoint-evaluation.test.cpp
• test/verify/yosupo-polynomial-interpolation.test.cpp

Code

/**
 * @brief Subproduct Tree
 */
template <template <typename> class FPS, typename Mint>
vector<FPS<Mint> > subproduct_tree(const FPS<Mint> &xs) {
  int n = (int)xs.size();
  int k = 1;
  while (k < n) k <<= 1;
  vector<FPS<Mint> > g(2 * k, {1});
  for (int i = 0; i < n; i++) g[k + i] = {-xs[i], Mint(1)};
  for (int i = k; i-- > 1;) g[i] = g[i << 1] * g[i << 1 | 1];
  return g;
}

#line 1 "math/fps/subproduct-tree.hpp"
/**
 * @brief Subproduct Tree
 */
template <template <typename> class FPS, typename Mint>
vector<FPS<Mint> > subproduct_tree(const FPS<Mint> &xs) {
  int n = (int)xs.size();
  int k = 1;
  while (k < n) k <<= 1;
  vector<FPS<Mint> > g(2 * k, {1});
  for (int i = 0; i < n; i++) g[k + i] = {-xs[i], Mint(1)};
  for (int i = k; i-- > 1;) g[i] = g[i << 1] * g[i << 1 | 1];
  return g;
}

Back to top page