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

Method size

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

Source from the content-addressed store, hash-verified

140 template<class...Args> poly(Args...args): a(args...) { }
141 poly(const initializer_list<mint> &x): a(x.begin(), x.end()) { }
142 int size() const { return (int)a.size(); }
143 inline mint coef(const int i) const { return (i < a.size() && i >= 0) ? a[i]: mint(0); }
144 mint operator[](const int i) const { return (i < a.size() && i >= 0) ? a[i]: mint(0); } //Beware!! p[i] = k won't change the value of p.a[i]
145 bool is_zero() const {

Callers 9

fftFunction · 0.45
multiplyFunction · 0.45
normalizeMethod · 0.45
coefMethod · 0.45
operator[]Method · 0.45
operator +Method · 0.45
operator -Method · 0.45
operator *Method · 0.45
div_xkMethod · 0.45

Calls

no outgoing calls

Tested by

no test coverage detected