polynomial/fps_inv.hpp

• View this file on GitHub
• Last update: 2022-07-21 11:01:31+09:00
• Include: #include "polynomial/fps_inv.hpp"

Depends on

• polynomial/polynomial.hpp

Required by

• polynomial/fps_log.hpp
• polynomial/fps_pow.hpp

Verified with

• polynomial/test/inv_of_formal_power_series.test.cpp
• polynomial/test/inv_of_formal_power_series_acl.test.cpp
• polynomial/test/log_of_formal_power_series.test.cpp
• polynomial/test/log_of_formal_power_series_acl.test.cpp
• polynomial/test/pow_of_formal_power_series.test.cpp
• polynomial/test/pow_of_formal_power_series_acl.test.cpp

Code

#pragma once

#include "polynomial.hpp"

template <typename T, typename Mul>
Polynomial<T, Mul> fps_inv(const Polynomial<T, Mul> &f, int sz = -1) {
    const std::vector<T> &coeff = f.vec();
    assert(!coeff.empty() && coeff[0] != T(0));
    if (sz == -1) {
        sz = (int) coeff.size();
    }
    assert(sz >= 0);
    std::vector<T> g({T(1) / coeff[0]});
    while ((int) g.size() < sz) {
        std::vector<T> fg;
        if (2 * g.size() <= coeff.size()) {
            fg = std::vector<T>(coeff.begin(), coeff.begin() + 2 * g.size());
        } else {
            fg = coeff;
            fg.resize(2 * g.size());
        }
        Mul::dft(fg);
        std::vector<T> dft_g = g;
        dft_g.resize(2 * g.size(), T(0));
        Mul::dft(dft_g);
        for (int i = 0; i < 2 * (int) g.size(); ++i) {
            fg[i] *= dft_g[i];
        }
        Mul::idft(fg);
        std::fill(fg.begin(), fg.begin() + g.size(), T(0));
        Mul::dft(fg);
        for (int i = 0; i < 2 * (int) g.size(); ++i) {
            fg[i] *= dft_g[i];
        }
        Mul::idft(fg);
        g.resize(2 * g.size());
        for (int i = (int) g.size() / 2; i < (int) g.size(); ++i) {
            g[i] = -fg[i];
        }
    }
    g.resize(sz);
    return Polynomial<T, Mul>(g);
}

#line 2 "polynomial/fps_inv.hpp"

#line 2 "polynomial/polynomial.hpp"

#include <vector>
#include <utility>
#include <cassert>
#include <algorithm>

template <typename T, typename Mul>
class Polynomial {
    std::vector<T> coeff;
    
public:
    using This = Polynomial<T, Mul>;
    
    Polynomial() : coeff() {}
    Polynomial(int n) : coeff(n, T(0)) {}
    Polynomial(std::vector<T> c) : coeff(std::move(c)) {}
    
    const std::vector<T> &vec() const {
        return coeff;
    }
    
    int size() const {
        return (int) coeff.size();
    }
    
    const T &operator[](int idx) const {
        return coeff[idx];
    }
    T &operator[](int idx) {
        return coeff[idx];
    }
    
    T at(int idx) const {
        if (idx < size()) {
            return coeff[idx];
        } else {
            return T(0);
        }
    }
    
    void pre_(int n) {
        assert(n >= 0);
        coeff.resize(n, T(0));
    }
    This pre(int n) const {
        This tmp(*this);
        tmp.pre_(n);
        return tmp;
    }
    
    T operator()(const T &x) const {
        T p(1), sum(0);
        for (const T &ele : coeff) {
            sum += p * ele;
            p *= x;
        }
        return sum;
    }
    
    This &operator+=(const This &rhs) {
        if (coeff.size() < rhs.coeff.size()) {
            coeff.resize(rhs.coeff.size(), T(0));
        }
        for (int i = 0; i < (int) rhs.coeff.size(); ++i) {
            coeff[i] += rhs.coeff[i];
        }
        return *this;
    }
    friend This operator+(This lhs, const This &rhs) {
        lhs += rhs;
        return lhs;
    }
    This &operator-=(const This &rhs) {
        if (coeff.size() < rhs.coeff.size()) {
            coeff.resize(rhs.coeff.size(), T(0));
        }
        for (int i = 0; i < (int) rhs.coeff.size(); ++i) {
            coeff[i] -= rhs.coeff[i];
        }
        return *this;
    }
    friend This operator-(This lhs, const This &rhs) {
        lhs -= rhs;
        return lhs;
    }
    
    This &operator*=(This rhs) {
        coeff = Mul::mul(std::move(coeff), std::move(rhs.coeff));
        return *this;
    }
    friend This operator*(This lhs, This rhs) {
        return This(Mul::mul(std::move(lhs.coeff), std::move(rhs.coeff)));
    }
    
    This diff() const {
        if (coeff.empty()) {
            return This();
        }
        std::vector<T> c(coeff.size() - 1);
        for (int i = 0; i < (int) c.size(); ++i) {
            c[i] = T(i + 1) * coeff[i + 1];
        }
        return This(c);
    }
    This integ() const {
        std::vector<T> c(coeff.size() + 1, T(0));
        for (int i = 0; i < (int) coeff.size(); ++i) {
            c[i + 1] = coeff[i] / T(i + 1);
        }
        return This(c);
    }
};
#line 4 "polynomial/fps_inv.hpp"

template <typename T, typename Mul>
Polynomial<T, Mul> fps_inv(const Polynomial<T, Mul> &f, int sz = -1) {
    const std::vector<T> &coeff = f.vec();
    assert(!coeff.empty() && coeff[0] != T(0));
    if (sz == -1) {
        sz = (int) coeff.size();
    }
    assert(sz >= 0);
    std::vector<T> g({T(1) / coeff[0]});
    while ((int) g.size() < sz) {
        std::vector<T> fg;
        if (2 * g.size() <= coeff.size()) {
            fg = std::vector<T>(coeff.begin(), coeff.begin() + 2 * g.size());
        } else {
            fg = coeff;
            fg.resize(2 * g.size());
        }
        Mul::dft(fg);
        std::vector<T> dft_g = g;
        dft_g.resize(2 * g.size(), T(0));
        Mul::dft(dft_g);
        for (int i = 0; i < 2 * (int) g.size(); ++i) {
            fg[i] *= dft_g[i];
        }
        Mul::idft(fg);
        std::fill(fg.begin(), fg.begin() + g.size(), T(0));
        Mul::dft(fg);
        for (int i = 0; i < 2 * (int) g.size(); ++i) {
            fg[i] *= dft_g[i];
        }
        Mul::idft(fg);
        g.resize(2 * g.size());
        for (int i = (int) g.size() / 2; i < (int) g.size(); ++i) {
            g[i] = -fg[i];
        }
    }
    g.resize(sz);
    return Polynomial<T, Mul>(g);
}

Back to top page