Update

Author: adamant-pwn

cp-algo/number_theory/euler.hpp

@@ -4,7 +4,8 @@
 #include "../util/big_alloc.hpp"
 namespace cp_algo::math {
     auto euler_phi(auto m) {
-        auto primes = to<big_vector>(factorize(m));
+        using T = std::decay_t<decltype(m)>;
+        auto primes = to<big_vector<T>>(factorize(m));
         std::ranges::sort(primes);
         auto [from, to] = std::ranges::unique(primes);
         primes.erase(from, to);

verify/structures/bitpack/det_mod_2.test.cpp

@@ -15,7 +15,7 @@ bit_array<maxn> a[maxn];
 void solve() {
     size_t n;
     cin >> n;
-    string row;
+    cp_algo::big_string row;
     cp_algo::big_vector<size_t> lead(n);
     for(size_t i = 0; i < n; i++) {
         cin >> row;

verify/structures/bitpack/inv_mod_2.test.cpp

@@ -14,7 +14,7 @@ bit_array<2 * maxn> a[maxn];
 void solve() {
     size_t n;
     cin >> n;
-    string row;
+    cp_algo::big_string row;
     cp_algo::big_vector<size_t> lead(n);
     for(size_t i = 0; i < n; i++) {
         cin >> row;

verify/structures/bitpack/prod_mod_2.test.cpp

@@ -31,7 +31,7 @@ void solve() {
     int n, m, k;
     cin >> n >> m >> k;
     cp_algo::checkpoint("init");
-    string row;
+    cp_algo::big_string row;
     for(int i = 0; i < n; i++) {
         cin >> row;
         from_string(a[i], row);

verify/structures/bitpack/system_mod_2.test.cpp

@@ -14,11 +14,11 @@ bit_array<maxn> a[maxn];
 void solve() {
     size_t n, m;
     cin >> n >> m;
-    cp_algo::big_vector<string> As(n);
+    cp_algo::big_vector<cp_algo::big_string> As(n);
     for(size_t i = 0; i < n; i++) {
         cin >> As[i];
     }
-    string bs;
+    cp_algo::big_string bs;
     cin >> bs;
     for(size_t i = 0; i < n; i++) {
         As[i] += bs[i];