MCPcopy Create free account
hub / github.com/ShahjalalShohag/code-library / integrate

Method integrate

Math/Subset Sum Problem.cpp:205–209  ·  view source on GitHub ↗

Source from the content-addressed store, hash-verified

203 return ans;
204 }
205 poly integrate() const {
206 int n = size(); vector<mint> ans(n + 1);
207 for(int i = 0; i < size(); i++) ans[i + 1] = coef(i) / (i + 1);
208 return ans;
209 }
210 poly inverse(int n) const { // 1 / p(x) % x^n, O(nlogn)
211 assert(!is_zero()); assert(a[0] != 0);
212 poly ans{mint(1) / a[0]};

Callers 1

logMethod · 0.45

Calls 1

sizeFunction · 0.85

Tested by

no test coverage detected