Update

Author: adamant-pwn

cp-algo/linalg/matrix.hpp

@@ -29,7 +29,7 @@ namespace cp_algo::linalg {
         matrix(Base &&t): Base(std::move(t)) {}
 
         template<std::ranges::input_range R>
-        matrix(R &&r): Base(std::ranges::to<Base>(std::forward<R>(r))) {}
+        matrix(R &&r): Base(std::from_range, std::forward<R>(r)) {}
 
         size_t n() const {return size(*this);}
         size_t m() const {return n() ? size(row(0)) : 0;}

cp-algo/linalg/vector.hpp

@@ -22,7 +22,7 @@ namespace cp_algo::linalg {
         vec(Base const& t): Base(t) {}
         vec(Base &&t): Base(std::move(t)) {}
         vec(size_t n): Base(n, base()) {}
-        vec(auto &&r): Base(std::ranges::to<Base>(r)) {}
+        vec(auto &&r): Base(std::from_range, r) {}
 
         static vec ei(size_t n, size_t i) {
             vec res(n);

cp-algo/number_theory/dirichlet.hpp

@@ -111,7 +111,8 @@ namespace cp_algo::math {
 
     auto Dirichlet_div(auto const& H, auto const& G, int64_t n) {
         auto m = std::size(G);
-        auto F = H | std::views::take(m) | std::ranges::to<big_vector>();
+        using elem_t = std::decay_t<decltype(*H.begin())>;
+        big_vector<elem_t> F(H.begin(), H.begin() + m);
         Dirichlet_div_inplace(F, G, n);
         return F;
     }

verify/number_theory/totient_sum.test.cpp

@@ -18,10 +18,10 @@ void solve() {
     cin >> n;
     auto H = floors(n) | views::transform([](int64_t k) {
         return base(k) * base(k + 1) / 2;
-    }) | ranges::to<vector>();
+    }) | ranges::to<cp_algo::big_vector<base>>();
     auto G = floors(n) | views::transform([](int64_t k) {
         return base(k);
-    }) | ranges::to<vector>();
+    }) | ranges::to<cp_algo::big_vector<base>>();
     auto F = Dirichlet_div(H, G, n);
     cout << F.back() << "\n";
 }