fps/product.hpp

• View this file on GitHub
• Last update: 2025-01-05 04:43:56+09:00
• Include: #include "fps/product.hpp"

Required by

• math_mod/stirling_number.hpp

Verified with

• verify/yosupo_fps/fps_product_of_polynomial_sequence.test.cpp
• verify/yosupo_math/enumerate_stirling_number_of_the_first_kind.test.cpp

Code

#ifndef KK2_FPS_PRODUCT_HPP
#define KK2_FPS_PRODUCT_HPP 1

#include <vector>

namespace kk2 {

template <class FPS, class mint = typename FPS::value_type>
FPS all_prod(const std::vector<FPS> &a) {
    return inner_all_prod(a, 0, (int)a.size());
}

template <class FPS, class mint = typename FPS::value_type>
FPS inner_all_prod(const std::vector<FPS> &a, int l, int r) {
    if (l == r) return FPS{1};
    if (l + 1 == r) return a[l];
    int m = (l + r) >> 1;
    return inner_all_prod(a, l, m) * inner_all_prod(a, m, r);
}

} // namespace kk2

#endif // KK2_FPS_PRODUCT_HPP

#line 1 "fps/product.hpp"



#include <vector>

namespace kk2 {

template <class FPS, class mint = typename FPS::value_type>
FPS all_prod(const std::vector<FPS> &a) {
    return inner_all_prod(a, 0, (int)a.size());
}

template <class FPS, class mint = typename FPS::value_type>
FPS inner_all_prod(const std::vector<FPS> &a, int l, int r) {
    if (l == r) return FPS{1};
    if (l + 1 == r) return a[l];
    int m = (l + r) >> 1;
    return inner_all_prod(a, l, m) * inner_all_prod(a, m, r);
}

} // namespace kk2

Back to top page