File tree Expand file tree Collapse file tree 2 files changed +4
-4
lines changed Expand file tree Collapse file tree 2 files changed +4
-4
lines changed Original file line number Diff line number Diff line change @@ -71,8 +71,8 @@ namespace cp_algo::math {
71
71
72
72
poly_t & reverse (size_t n) {return poly::impl::reverse (*this , n);}
73
73
poly_t & reverse () {return reverse (size (a));}
74
- poly_t reversed (size_t n) {return poly_t (*this ).reverse (n);}
75
- poly_t reversed () {return poly_t (*this ).reverse ();}
74
+ poly_t reversed (size_t n) const {return poly_t (*this ).reverse (n);}
75
+ poly_t reversed () const {return poly_t (*this ).reverse ();}
76
76
77
77
std::array<poly_t , 2 > divmod (poly_t const & b) const {
78
78
return poly::impl::divmod (*this , b);
Original file line number Diff line number Diff line change @@ -31,7 +31,7 @@ namespace cp_algo::math::poly::impl {
31
31
}
32
32
poly D;
33
33
if (d >= 0 ) {
34
- D = (p.reverse ().mod_xk (d + 1 ) * qri.mod_xk (d + 1 )).mod_xk (d + 1 ).reverse (d + 1 );
34
+ D = (p.reversed ().mod_xk (d + 1 ) * qri.mod_xk (d + 1 )).mod_xk (d + 1 ).reversed (d + 1 );
35
35
}
36
36
return std::array{D, p - D * q};
37
37
}
@@ -41,7 +41,7 @@ namespace cp_algo::math::poly::impl {
41
41
if (std::min (d, q.deg ()) < magic) {
42
42
return divmod_slow (p, q);
43
43
}
44
- return divmod_hint (p, q, q.reverse ().inv (d + 1 ));
44
+ return divmod_hint (p, q, q.reversed ().inv (d + 1 ));
45
45
}
46
46
47
47
template <typename poly>
You can’t perform that action at this time.
0 commit comments