manoflearning · manoflearning · Nov 18, 2025 · Nov 18, 2025
diff --git a/1-data-structure/fenwick_tree.cpp → refcode/1-ds/fenwick_tree.hpp b/1-data-structure/fenwick_tree.cpp → refcode/1-ds/fenwick_tree.hpp
@@ -1,5 +1,5 @@
 #include "../common/common.hpp"
-
+namespace refcode {
 // 1. Fenwick Tree
 struct Fenwick { // 0-indexed
   int flag, cnt; // array size
@@ -23,7 +23,7 @@ struct Fenwick { // 0-indexed
   }
   void modify(int p, ll value) { // set value at position p
     add(p, value - arr[p]);
-  };
+  }
   ll query(int x) {
     ll ret = 0;
     while (x >= 0) ret += t[x], x = (x & (x + 1)) - 1;
@@ -43,10 +43,9 @@ struct Fenwick { // 0-indexed
     }
     return l;
   }
-} fw;
-
+};
 // 2. Fenwick Tree Range Update Point Query
-struct Fenwick { // 1-indexed
+struct FenwickRUPQ { // 1-indexed
   int flag;
   vector<ll> t;
   void build(int N) {
@@ -62,8 +61,7 @@ struct Fenwick { // 1-indexed
     for (; x; x ^= x & -x) ret += t[x];
     return ret;
   }
-} fw;
-
+};
 // 3. 2D Fenwick Tree
 // INPUT: Given an 2D array of integers of size N * M.
 // Can modify the value of the (x, y)th element.
@@ -130,4 +128,5 @@ struct Fenwick2D { // 0-indexed
     if (sx && sy) ret += query(sx - 1, sy - 1);
     return ret;
   }
-} fw2d;
+};
+} // namespace refcode
diff --git a/1-data-structure/li_chao_tree.cpp → refcode/1-ds/li_chao_tree.hpp b/1-data-structure/li_chao_tree.cpp → refcode/1-ds/li_chao_tree.hpp
@@ -1,14 +1,13 @@
 #include "../common/common.hpp"
-
+namespace refcode {
 // INPUT: Initially, a 2d plane in which no linear function exists is given.
 // Two types of queries are given.
 // 1 a b : The linear function f(x) = ax + b is added.
 // 2 x : Find the max(f(x)) among the linear functions given so far.
 // OUTPUT: For each query 2 x, output the max(f(x)) among the linear functions given so far.
 // TIME COMPLEXITY: O(qlogq)
-#define Line pair<ll, ll>
-
-const Line e = {0, -1e18};
+using Line = pair<ll, ll>;
+constexpr Line e = {0, -1e18};
 struct LiChaoTree {
   ll f(Line l, ll x) { return l.first * x + l.second; }
   struct Node {
@@ -56,4 +55,5 @@ struct LiChaoTree {
     else ret = max(ret, query(x, t[n].r));
     return ret;
   }
-} lct;
+};
+} // namespace refcode
diff --git a/1-data-structure/merge_sort_tree.cpp → refcode/1-ds/merge_sort_tree.hpp b/1-data-structure/merge_sort_tree.cpp → refcode/1-ds/merge_sort_tree.hpp
@@ -1,10 +1,10 @@
 #include "../common/common.hpp"
-
+namespace refcode {
+constexpr int MAX_MST = 1 << 17;
 // 1. Merge Sort Tree
 // INPUT: Given a sequence A_1, A_2, ..., A_n of length n. Given a query (i, j, k).
 // OUTPUT: For each query (i, j, k), output the number of elements greater than k among elements A_i, A_{i+1}, ..., A_j.
 // TIME COMPLEXITY: O(nlogn) for initialize Merge Sort Tree, O(log^2n) for each query.
-const int MAX_MST = 1 << 17;
 struct MergeSortTree {
   vector<int> t[MAX_MST << 1];
   void build(const vector<int> &arr) {
@@ -22,14 +22,12 @@ struct MergeSortTree {
     int mid = (nl + nr) >> 1;
     return query(l, r, k, n << 1, nl, mid) + query(l, r, k, n << 1 | 1, mid + 1, nr);
   }
-} mstree;
-
+};
 // 2. Iterative Merge Sort Tree
 // INPUT: Given a sequence A_1, A_2, ..., A_n of length n. Given a query (i, j, k).
 // OUTPUT: For each query (i, j, k), output the number of elements greater than k among elements A_i, A_{i+1}, ..., A_j.
 // TIME COMPLEXITY: O(nlogn) for initialize Merge Sort Tree, O(log^2n) for each query.
-const int MAX_MST = 1 << 17;
-struct MergeSortTree {
+struct MergeSortTreeIter {
   vector<int> t[MAX_MST << 1];
   void build(const vector<int> &arr) {
     for (int i = 0; i < sz(arr); i++)
@@ -49,4 +47,5 @@ struct MergeSortTree {
     }
     return ret;
   }
-} mstree;
+};
+} // namespace refcode
diff --git a/1-data-structure/segment_tree.cpp → refcode/1-ds/segment_tree.hpp b/1-data-structure/segment_tree.cpp → refcode/1-ds/segment_tree.hpp
@@ -1,7 +1,7 @@
 #include "../common/common.hpp"
-
+namespace refcode {
+int flag; // array size
 // 1. Segment Tree
-int flag;    // array size
 struct Seg { // 1-indexed
   vector<ll> t;
   void build(int n) {
@@ -19,12 +19,11 @@ struct Seg { // 1-indexed
     int mid = (nl + nr) / 2;
     return query(l, r, n << 1, nl, mid) + query(l, r, n << 1 | 1, mid + 1, nr);
   }
-} seg;
-
+};
 // 2. Iterative Segment Tree
-const int MAXN = 1010101; // limit for array size
-struct Seg {              // 0-indexed
-  int n;                  // array size
+constexpr int MAXN = 1010101; // limit for array size
+struct SegIter {              // 0-indexed
+  int n;                      // array size
   ll t[2 * MAXN];
   void build(int N) {
     n = N;
@@ -42,11 +41,9 @@ struct Seg {              // 0-indexed
     }
     return ret;
   }
-} seg;
-
+};
 // 3. k-th Segment Tree
-int flag; // array size
-struct Seg {
+struct SegKth {
   vector<ll> t;
   void build(int n) {
     for (flag = 1; flag < n; flag <<= 1);
@@ -61,11 +58,9 @@ struct Seg {
     if (k <= t[n << 1]) return kth(k, n << 1);
     else return kth(k - t[n << 1], n << 1 | 1);
   }
-} seg;
-
+};
 // 4. Segment Tree with Lazy Propagation
-int flag;    // array size
-struct Seg { // 1-indexed
+struct SegLazy { // 1-indexed
   vector<ll> t, lazy;
   void build(int n) {
     for (flag = 1; flag < n; flag <<= 1);
@@ -105,8 +100,7 @@ struct Seg { // 1-indexed
       lazy[n] = 0;
     }
   }
-} seg;
-
+};
 // 5. Persistent Segment Tree
 // TIME COMPLEXITY: O(n) for initialize PST, O(logn) for each query.
 // SPACE COMPLEXITY: O(nlogm).
@@ -153,7 +147,6 @@ struct PST { // 1-indexed
       t[n2].val = val;
       return;
     }
-
     int mid = (l + r) >> 1;
     if (p <= mid) {
       t[n2].r = t[n1].r;
@@ -184,17 +177,14 @@ struct PST { // 1-indexed
     assert(n < sz(root));
     return query(l, r, root[n], 1, flag);
   }
-} pst;
-
+};
 // 6. Dynamic Segment Tree
-const int MAXL = 1, MAXR = 1000000;
-
+constexpr int MAXL = 1, MAXR = 1000000;
 struct Node {
   ll x;
   int l, r;
 };
-
-struct Dyseg {
+struct DySeg {
   vector<Node> t = {{0, -1, -1}, {0, -1, -1}};
   void modify(int p, ll x, int n = 1, int nl = MAXL, int nr = MAXR) {
     if (p < nl || nr < p) return;
@@ -237,4 +227,5 @@ struct Dyseg {
     }
     return ret;
   }
-} dyseg;
+};
+} // namespace refcode
diff --git a/1-data-structure/union_find.cpp → refcode/1-ds/union_find.hpp b/1-data-structure/union_find.cpp → refcode/1-ds/union_find.hpp
@@ -1,10 +1,10 @@
 #include "../common/common.hpp"
-
+namespace refcode {
 struct UF {
   vector<int> uf;
-  void build(int N) {
+  void build(int n) {
     uf.clear();
-    uf.resize(N + 1, -1);
+    uf.resize(n + 1, -1);
   }
   int find(int v) {
     if (uf[v] < 0) return v;
@@ -16,4 +16,5 @@ struct UF {
     uf[U] += uf[V];
     uf[V] = U;
   }
-} uf;
+};
+} // namespace refcode
diff --git a/2-graph/bcc.cpp → refcode/2-graph/bcc.cpp b/2-graph/bcc.cpp → refcode/2-graph/bcc.cpp
diff --git a/.../dijkstra_bellman_ford_floyd_warshall.cpp → .../dijkstra_bellman_ford_floyd_warshall.cpp b/.../dijkstra_bellman_ford_floyd_warshall.cpp → .../dijkstra_bellman_ford_floyd_warshall.cpp
diff --git a/2-graph/euler_circuit.cpp → refcode/2-graph/euler_circuit.cpp b/2-graph/euler_circuit.cpp → refcode/2-graph/euler_circuit.cpp
diff --git a/2-graph/kth_shortest_path.cpp → refcode/2-graph/kth_shortest_path.cpp b/2-graph/kth_shortest_path.cpp → refcode/2-graph/kth_shortest_path.cpp
diff --git a/2-graph/offline_dynamic_connectivity.cpp → .../2-graph/offline_dynamic_connectivity.cpp b/2-graph/offline_dynamic_connectivity.cpp → .../2-graph/offline_dynamic_connectivity.cpp
diff --git a/2-graph/scc_2_sat.cpp → refcode/2-graph/scc_2_sat.cpp b/2-graph/scc_2_sat.cpp → refcode/2-graph/scc_2_sat.cpp
diff --git a/2-graph/tree_cd.cpp → refcode/2-graph/tree_cd.cpp b/2-graph/tree_cd.cpp → refcode/2-graph/tree_cd.cpp
diff --git a/2-graph/tree_composition.cpp → refcode/2-graph/tree_composition.cpp b/2-graph/tree_composition.cpp → refcode/2-graph/tree_composition.cpp
diff --git a/2-graph/tree_exchange_argument.cpp → refcode/2-graph/tree_exchange_argument.cpp b/2-graph/tree_exchange_argument.cpp → refcode/2-graph/tree_exchange_argument.cpp
diff --git a/2-graph/tree_hld.cpp → refcode/2-graph/tree_hld.cpp b/2-graph/tree_hld.cpp → refcode/2-graph/tree_hld.cpp
diff --git a/2-graph/tree_lca_sparse_table.cpp → refcode/2-graph/tree_lca_sparse_table.cpp b/2-graph/tree_lca_sparse_table.cpp → refcode/2-graph/tree_lca_sparse_table.cpp
diff --git a/3-network-flow/bipartite_matching.cpp → refcode/3-flow/bipartite_matching.cpp b/3-network-flow/bipartite_matching.cpp → refcode/3-flow/bipartite_matching.cpp
diff --git a/3-network-flow/dinics_algorithm.cpp → refcode/3-flow/dinics_algorithm.cpp b/3-network-flow/dinics_algorithm.cpp → refcode/3-flow/dinics_algorithm.cpp
diff --git a/3-network-flow/hopcroft_karp_algorithm.cpp → refcode/3-flow/hopcroft_karp_algorithm.cpp b/3-network-flow/hopcroft_karp_algorithm.cpp → refcode/3-flow/hopcroft_karp_algorithm.cpp
diff --git a/3-network-flow/maximum_flow.cpp → refcode/3-flow/maximum_flow.cpp b/3-network-flow/maximum_flow.cpp → refcode/3-flow/maximum_flow.cpp
diff --git a/3-network-flow/mcmf.cpp → refcode/3-flow/mcmf.cpp b/3-network-flow/mcmf.cpp → refcode/3-flow/mcmf.cpp
diff --git a/4-string/aho_corasick.cpp → refcode/4-string/aho_corasick.cpp b/4-string/aho_corasick.cpp → refcode/4-string/aho_corasick.cpp
diff --git a/4-string/kmp_algorithm.cpp → refcode/4-string/kmp_algorithm.cpp b/4-string/kmp_algorithm.cpp → refcode/4-string/kmp_algorithm.cpp
diff --git a/4-string/manachers_algorithm.cpp → refcode/4-string/manachers_algorithm.cpp b/4-string/manachers_algorithm.cpp → refcode/4-string/manachers_algorithm.cpp
diff --git a/4-string/rabin_karp_algorithm.cpp → refcode/4-string/rabin_karp_algorithm.cpp b/4-string/rabin_karp_algorithm.cpp → refcode/4-string/rabin_karp_algorithm.cpp
diff --git a/4-string/suffix_array.cpp → refcode/4-string/suffix_array.cpp b/4-string/suffix_array.cpp → refcode/4-string/suffix_array.cpp
diff --git a/4-string/trie.cpp → refcode/4-string/trie.cpp b/4-string/trie.cpp → refcode/4-string/trie.cpp
diff --git a/4-string/z_algorithm.cpp → refcode/4-string/z_algorithm.cpp b/4-string/z_algorithm.cpp → refcode/4-string/z_algorithm.cpp
diff --git a/5-geometry/bulldozer_trick.cpp → refcode/5-geometry/bulldozer_trick.cpp b/5-geometry/bulldozer_trick.cpp → refcode/5-geometry/bulldozer_trick.cpp
diff --git a/5-geometry/ccw_algorithm.cpp → refcode/5-geometry/ccw_algorithm.cpp b/5-geometry/ccw_algorithm.cpp → refcode/5-geometry/ccw_algorithm.cpp
diff --git a/5-geometry/convex_hull.cpp → refcode/5-geometry/convex_hull.cpp b/5-geometry/convex_hull.cpp → refcode/5-geometry/convex_hull.cpp
diff --git a/5-geometry/minimum_enclosing_circle.cpp → ...e/5-geometry/minimum_enclosing_circle.cpp b/5-geometry/minimum_enclosing_circle.cpp → ...e/5-geometry/minimum_enclosing_circle.cpp
diff --git a/5-geometry/ray_casting.cpp → refcode/5-geometry/ray_casting.cpp b/5-geometry/ray_casting.cpp → refcode/5-geometry/ray_casting.cpp
diff --git a/5-geometry/rotating_callipers.cpp → refcode/5-geometry/rotating_callipers.cpp b/5-geometry/rotating_callipers.cpp → refcode/5-geometry/rotating_callipers.cpp
diff --git a/5-geometry/sort_by_angular.cpp → refcode/5-geometry/sort_by_angular.cpp b/5-geometry/sort_by_angular.cpp → refcode/5-geometry/sort_by_angular.cpp
diff --git a/6-math/basic_sqrt_time_algorithms.cpp → ...ode/6-math/basic_sqrt_time_algorithms.cpp b/6-math/basic_sqrt_time_algorithms.cpp → ...ode/6-math/basic_sqrt_time_algorithms.cpp
diff --git a/6-math/binomial_coefficient.cpp → refcode/6-math/binomial_coefficient.cpp b/6-math/binomial_coefficient.cpp → refcode/6-math/binomial_coefficient.cpp
diff --git a/6-math/catalan_number_derangement_number.cpp → ...ath/catalan_number_derangement_number.cpp b/6-math/catalan_number_derangement_number.cpp → ...ath/catalan_number_derangement_number.cpp
diff --git a/6-math/chinese_remainder_theorem.cpp → refcode/6-math/chinese_remainder_theorem.cpp b/6-math/chinese_remainder_theorem.cpp → refcode/6-math/chinese_remainder_theorem.cpp
diff --git a/6-math/euclidean_algorithms.cpp → refcode/6-math/euclidean_algorithms.cpp b/6-math/euclidean_algorithms.cpp → refcode/6-math/euclidean_algorithms.cpp
diff --git a/6-math/eulers_phi_function.cpp → refcode/6-math/eulers_phi_function.cpp b/6-math/eulers_phi_function.cpp → refcode/6-math/eulers_phi_function.cpp
diff --git a/6-math/fft.cpp → refcode/6-math/fft.cpp b/6-math/fft.cpp → refcode/6-math/fft.cpp
diff --git a/6-math/gauss_jordan_elimination.cpp → refcode/6-math/gauss_jordan_elimination.cpp b/6-math/gauss_jordan_elimination.cpp → refcode/6-math/gauss_jordan_elimination.cpp
diff --git a/6-math/matrix.cpp → refcode/6-math/matrix.cpp b/6-math/matrix.cpp → refcode/6-math/matrix.cpp
diff --git a/6-math/miller_rabin_pollard_rho.cpp → refcode/6-math/miller_rabin_pollard_rho.cpp b/6-math/miller_rabin_pollard_rho.cpp → refcode/6-math/miller_rabin_pollard_rho.cpp
diff --git a/6-math/mobius.cpp → refcode/6-math/mobius.cpp b/6-math/mobius.cpp → refcode/6-math/mobius.cpp
diff --git a/6-math/sieve.cpp → refcode/6-math/sieve.cpp b/6-math/sieve.cpp → refcode/6-math/sieve.cpp
diff --git a/7-misc/dp_opt.cpp → refcode/7-misc/dp_opt.cpp b/7-misc/dp_opt.cpp → refcode/7-misc/dp_opt.cpp
diff --git a/7-misc/fraction_data_type.cpp → refcode/7-misc/fraction_data_type.cpp b/7-misc/fraction_data_type.cpp → refcode/7-misc/fraction_data_type.cpp
diff --git a/7-misc/kitamasa.cpp → refcode/7-misc/kitamasa.cpp b/7-misc/kitamasa.cpp → refcode/7-misc/kitamasa.cpp
diff --git a/7-misc/lis_in_o_nlogn.cpp → refcode/7-misc/lis_in_o_nlogn.cpp b/7-misc/lis_in_o_nlogn.cpp → refcode/7-misc/lis_in_o_nlogn.cpp
diff --git a/7-misc/random.cpp → refcode/7-misc/random.cpp b/7-misc/random.cpp → refcode/7-misc/random.cpp
diff --git a/...manhattan_distance_chebyshev_distance.txt → ...manhattan_distance_chebyshev_distance.txt b/...manhattan_distance_chebyshev_distance.txt → ...manhattan_distance_chebyshev_distance.txt
diff --git a/7-misc/simd.cpp → refcode/7-misc/simd.cpp b/7-misc/simd.cpp → refcode/7-misc/simd.cpp
diff --git a/7-misc/sqrt_decomposition_mos_algorithm.cpp → ...misc/sqrt_decomposition_mos_algorithm.cpp b/7-misc/sqrt_decomposition_mos_algorithm.cpp → ...misc/sqrt_decomposition_mos_algorithm.cpp
diff --git a/7-misc/system_of_difference_constraints.cpp → ...misc/system_of_difference_constraints.cpp b/7-misc/system_of_difference_constraints.cpp → ...misc/system_of_difference_constraints.cpp
diff --git a/7-misc/ternary_search.cpp → refcode/7-misc/ternary_search.cpp b/7-misc/ternary_search.cpp → refcode/7-misc/ternary_search.cpp
diff --git a/common/common.hpp → refcode/common/common.hpp b/common/common.hpp → refcode/common/common.hpp
@@ -7,7 +7,7 @@ using ll = long long;
 using pii = pair<int, int>;
 using pll = pair<ll, ll>;
 
-#define sz(x) (int)(x).size()
-#define all(x) (x).begin(), (x).end()
 #define fr first
 #define sc second
+#define sz(x) (int)(x).size()
+#define all(x) (x).begin(), (x).end()
diff --git a/test/.gitkeep b/test/.gitkeep