Fixed

ageprocpp · Jun 25, 2023 · b2e1d86 · b2e1d86
1 parent efa00c7
commit b2e1d86
Show file tree

Hide file tree

Showing 67 changed files with 75 additions and 75 deletions.
diff --git a/test/aoj/ALDS1_14_B_HashedString.test.cpp b/test/aoj/ALDS1_14_B_HashedString.test.cpp
@@ -1,5 +1,5 @@
 #define PROBLEM "https://onlinejudge.u-aizu.ac.jp/problems/ALDS1_14_B"
-#include "../../other/template.hpp"
+#include "../../basic/template.hpp"
 #include "../../string/HashedString.hpp"
 std::string t, p;
 int main() {

diff --git a/test/aoj/ALDS1_14_B_SuffixArray.test.cpp b/test/aoj/ALDS1_14_B_SuffixArray.test.cpp
@@ -1,5 +1,5 @@
 #define PROBLEM "https://onlinejudge.u-aizu.ac.jp/problems/ALDS1_14_B"
-#include "../../other/template.hpp"
+#include "../../basic/template.hpp"
 #include "../../string/SuffixArray.hpp"
 std::string t, p;
 int main() {

diff --git a/test/aoj/CGL_1_A.test.cpp b/test/aoj/CGL_1_A.test.cpp
@@ -1,6 +1,6 @@
 #define PROBLEM "https://onlinejudge.u-aizu.ac.jp/problems/CGL_1_A"
 #define ERROR "1e-8"
-#include "../../other/template.hpp"
+#include "../../basic/template.hpp"
 #include "../../math/Geometry.hpp"
 int main() {
 	int x1, y1, x2, y2;

diff --git a/test/aoj/CGL_1_B.test.cpp b/test/aoj/CGL_1_B.test.cpp
@@ -1,6 +1,6 @@
 #define PROBLEM "https://onlinejudge.u-aizu.ac.jp/problems/CGL_1_B"
 #define ERROR "1e-8"
-#include "../../other/template.hpp"
+#include "../../basic/template.hpp"
 #include "../../math/Geometry.hpp"
 int main() {
 	int x1, y1, x2, y2;

diff --git a/test/aoj/CGL_1_C.test.cpp b/test/aoj/CGL_1_C.test.cpp
@@ -1,5 +1,5 @@
 #define PROBLEM "https://onlinejudge.u-aizu.ac.jp/problems/CGL_1_C"
-#include "../../other/template.hpp"
+#include "../../basic/template.hpp"
 #include "../../math/Geometry.hpp"
 int main() {
 	int x1, y1, x2, y2;

diff --git a/test/aoj/CGL_2_A.test.cpp b/test/aoj/CGL_2_A.test.cpp
@@ -1,5 +1,5 @@
 #define PROBLEM "https://onlinejudge.u-aizu.ac.jp/problems/CGL_2_A"
-#include "../../other/template.hpp"
+#include "../../basic/template.hpp"
 #include "../../math/Geometry.hpp"
 int main() {
 	int q;

diff --git a/test/aoj/CGL_2_B.test.cpp b/test/aoj/CGL_2_B.test.cpp
@@ -1,5 +1,5 @@
 #define PROBLEM "https://onlinejudge.u-aizu.ac.jp/problems/CGL_2_B"
-#include "../../other/template.hpp"
+#include "../../basic/template.hpp"
 #include "../../math/Geometry.hpp"
 int main() {
 	int q;

diff --git a/test/aoj/CGL_2_C.test.cpp b/test/aoj/CGL_2_C.test.cpp
@@ -1,6 +1,6 @@
 #define PROBLEM "https://onlinejudge.u-aizu.ac.jp/problems/CGL_2_C"
 #define ERROR "1e-8"
-#include "../../other/template.hpp"
+#include "../../basic/template.hpp"
 #include "../../math/Geometry.hpp"
 int main() {
 	int q;

diff --git a/test/aoj/CGL_2_D.test.cpp b/test/aoj/CGL_2_D.test.cpp
@@ -1,6 +1,6 @@
 #define PROBLEM "https://onlinejudge.u-aizu.ac.jp/problems/CGL_2_D"
 #define ERROR "1e-8"
-#include "../../other/template.hpp"
+#include "../../basic/template.hpp"
 #include "../../math/Geometry.hpp"
 int main() {
 	int q;

diff --git a/test/aoj/CGL_3_A.test.cpp b/test/aoj/CGL_3_A.test.cpp
@@ -1,5 +1,5 @@
 #define PROBLEM "https://onlinejudge.u-aizu.ac.jp/problems/CGL_3_A"
-#include "../../other/template.hpp"
+#include "../../basic/template.hpp"
 #include "../../math/Geometry.hpp"
 int main() {
 	int n;

diff --git a/test/aoj/CGL_3_B.test.cpp b/test/aoj/CGL_3_B.test.cpp
@@ -1,5 +1,5 @@
 #define PROBLEM "https://onlinejudge.u-aizu.ac.jp/problems/CGL_3_B"
-#include "../../other/template.hpp"
+#include "../../basic/template.hpp"
 #include "../../math/Geometry.hpp"
 int main() {
 	int n;

diff --git a/test/aoj/CGL_3_C.test.cpp b/test/aoj/CGL_3_C.test.cpp
@@ -1,5 +1,5 @@
 #define PROBLEM "https://onlinejudge.u-aizu.ac.jp/problems/CGL_3_C"
-#include "../../other/template.hpp"
+#include "../../basic/template.hpp"
 #include "../../math/Geometry.hpp"
 int main() {
 	int n, q;

diff --git a/test/aoj/CGL_4_A.test.cpp b/test/aoj/CGL_4_A.test.cpp
@@ -1,5 +1,5 @@
 #define PROBLEM "https://onlinejudge.u-aizu.ac.jp/problems/CGL_4_A"
-#include "../../other/template.hpp"
+#include "../../basic/template.hpp"
 #include "../../math/Geometry.hpp"
 int main() {
 	int n;

diff --git a/test/aoj/CGL_4_B.test.cpp b/test/aoj/CGL_4_B.test.cpp
@@ -1,5 +1,5 @@
 #define PROBLEM "https://onlinejudge.u-aizu.ac.jp/problems/CGL_4_B"
-#include "../../other/template.hpp"
+#include "../../basic/template.hpp"
 #include "../../math/Geometry.hpp"
 int main() {
 	int n;

diff --git a/test/aoj/DSL_2_A.test.cpp b/test/aoj/DSL_2_A.test.cpp
@@ -1,6 +1,6 @@
 #define PROBLEM "https://onlinejudge.u-aizu.ac.jp/problems/DSL_2_A"
 #include "../../data-structure/SegTree.hpp"
-#include "../../other/template.hpp"
+#include "../../basic/template.hpp"
 int n, q;
 int main() {
 	scanf("%d%d", &n, &q);

diff --git a/test/aoj/DSL_2_B.test.cpp b/test/aoj/DSL_2_B.test.cpp
@@ -1,6 +1,6 @@
 #define PROBLEM "https://onlinejudge.u-aizu.ac.jp/problems/DSL_2_B"
 #include "../../data-structure/SegTree.hpp"
-#include "../../other/template.hpp"
+#include "../../basic/template.hpp"
 int n, q;
 int main() {
 	scanf("%d%d", &n, &q);

diff --git a/test/aoj/DSL_2_D.test.cpp b/test/aoj/DSL_2_D.test.cpp
@@ -1,6 +1,6 @@
 #define PROBLEM "https://onlinejudge.u-aizu.ac.jp/problems/DSL_2_D"
 #include "../../data-structure/IntervalSegTree.hpp"
-#include "../../other/template.hpp"
+#include "../../basic/template.hpp"
 int n, q;
 int main() {
 	scanf("%d%d", &n, &q);

diff --git a/test/aoj/DSL_2_E.test.cpp b/test/aoj/DSL_2_E.test.cpp
@@ -1,6 +1,6 @@
 #define PROBLEM "https://onlinejudge.u-aizu.ac.jp/problems/DSL_2_E"
 #include "../../data-structure/IntervalSegTree.hpp"
-#include "../../other/template.hpp"
+#include "../../basic/template.hpp"
 int n, q;
 int main() {
 	scanf("%d%d", &n, &q);

diff --git a/test/aoj/DSL_2_F.test.cpp b/test/aoj/DSL_2_F.test.cpp
@@ -1,6 +1,6 @@
 #define PROBLEM "https://onlinejudge.u-aizu.ac.jp/problems/DSL_2_F"
 #include "../../data-structure/IntervalSegTree.hpp"
-#include "../../other/template.hpp"
+#include "../../basic/template.hpp"
 int n, q;
 int main() {
 	scanf("%d%d", &n, &q);

diff --git a/test/aoj/DSL_2_G.test.cpp b/test/aoj/DSL_2_G.test.cpp
@@ -1,6 +1,6 @@
 #define PROBLEM "https://onlinejudge.u-aizu.ac.jp/problems/DSL_2_G"
 #include "../../data-structure/IntervalSegTree.hpp"
-#include "../../other/template.hpp"
+#include "../../basic/template.hpp"
 int n, q;
 int main() {
 	scanf("%d%d", &n, &q);

diff --git a/test/aoj/DSL_2_H.test.cpp b/test/aoj/DSL_2_H.test.cpp
@@ -1,6 +1,6 @@
 #define PROBLEM "https://onlinejudge.u-aizu.ac.jp/problems/DSL_2_H"
 #include "../../data-structure/IntervalSegTree.hpp"
-#include "../../other/template.hpp"
+#include "../../basic/template.hpp"
 int n, q;
 int main() {
 	scanf("%d%d", &n, &q);

diff --git a/test/aoj/DSL_2_I.test.cpp b/test/aoj/DSL_2_I.test.cpp
@@ -1,6 +1,6 @@
 #define PROBLEM "https://onlinejudge.u-aizu.ac.jp/problems/DSL_2_I"
 #include "../../data-structure/IntervalSegTree.hpp"
-#include "../../other/template.hpp"
+#include "../../basic/template.hpp"
 int n, q;
 int main() {
 	scanf("%d%d", &n, &q);

diff --git a/test/aoj/GRL_6_A_Dinic.test.cpp b/test/aoj/GRL_6_A_Dinic.test.cpp
@@ -1,6 +1,6 @@
 #define PROBLEM "https://onlinejudge.u-aizu.ac.jp/problems/GRL_6_A"
 #include "../../graph/Dinic.hpp"
-#include "../../other/template.hpp"
+#include "../../basic/template.hpp"
 int v, e;
 int main() {
 	scanf("%d%d", &v, &e);

diff --git a/test/aoj/GRL_6_A_FordFulkerson.test.cpp b/test/aoj/GRL_6_A_FordFulkerson.test.cpp
@@ -1,6 +1,6 @@
 #define PROBLEM "https://onlinejudge.u-aizu.ac.jp/problems/GRL_6_A"
 #include "../../graph/FordFulkerson.hpp"
-#include "../../other/template.hpp"
+#include "../../basic/template.hpp"
 int v, e;
 int main() {
 	scanf("%d%d", &v, &e);

diff --git a/test/aoj/GRL_6_B.test.cpp b/test/aoj/GRL_6_B.test.cpp
@@ -1,6 +1,6 @@
 #define PROBLEM "https://onlinejudge.u-aizu.ac.jp/problems/GRL_6_B"
 #include "../../graph/PrimalDual.hpp"
-#include "../../other/template.hpp"
+#include "../../basic/template.hpp"
 int n, m, f;
 int main() {
 	scanf("%d%d%d", &n, &m, &f);

diff --git a/test/yosupo/aplusb.test.cpp b/test/yosupo/aplusb.test.cpp
@@ -1,5 +1,5 @@
 #define PROBLEM "https://judge.yosupo.jp/problem/aplusb"
-#include "../../other/template.hpp"
+#include "../../basic/template.hpp"
 int main() {
 	int a, b;
 	scanf("%d%d", &a, &b);

diff --git a/test/yosupo/associative_array.test.cpp b/test/yosupo/associative_array.test.cpp
@@ -1,5 +1,5 @@
 #define PROBLEM "https://judge.yosupo.jp/problem/associative_array"
-#include "../../other/template.hpp"
+#include "../../basic/template.hpp"
 int main() {
 	int q, type;
 	lint k, v;

diff --git a/test/yosupo/bipartitematching.test.cpp b/test/yosupo/bipartitematching.test.cpp
@@ -1,6 +1,6 @@
 #define PROBLEM "https://judge.yosupo.jp/problem/bipartitematching"
-#include "../../other/template.hpp"
-#include "../../other/FastIO.hpp"
+#include "../../basic/template.hpp"
+#include "../../basic/FastIO.hpp"
 #include "../../graph/Dinic.hpp"
 FastIO::Scanner cin;
 FastIO::Printer cout;

diff --git a/test/yosupo/convolution_mod.test.cpp b/test/yosupo/convolution_mod.test.cpp
@@ -1,6 +1,6 @@
 #define PROBLEM "https://judge.yosupo.jp/problem/convolution_mod"
 #include "../../math/NumberTheoreticTransform.hpp"
-#include "../../other/template.hpp"
+#include "../../basic/template.hpp"
 int n, m;
 std::vector<int> a, b;
 int main() {

diff --git a/test/yosupo/convolution_mod_1000000007.test.cpp b/test/yosupo/convolution_mod_1000000007.test.cpp
@@ -1,6 +1,6 @@
 #define PROBLEM "https://judge.yosupo.jp/problem/convolution_mod_1000000007"
-#include "../../other/template.hpp"
-#include "../../other/FastIO.hpp"
+#include "../../basic/template.hpp"
+#include "../../basic/FastIO.hpp"
 #include "../../math/FormalPowerSeries.hpp"
 using FPS = FormalPowerSeries<StaticModInt<1000000007>>;
 FastIO::Scanner cin;

diff --git a/test/yosupo/convolution_mod_large.test.cpp b/test/yosupo/convolution_mod_large.test.cpp
@@ -1,6 +1,6 @@
 #define PROBLEM "https://judge.yosupo.jp/problem/convolution_mod_large"
-#include "../../other/template.hpp"
-#include "../../other/FastIO.hpp"
+#include "../../basic/template.hpp"
+#include "../../basic/FastIO.hpp"
 #include "../../math/FormalPowerSeries.hpp"
 using FPS = FormalPowerSeries<StaticModInt<998244353>>;
 FastIO::Scanner cin;

diff --git a/test/yosupo/counting_primes.test.cpp b/test/yosupo/counting_primes.test.cpp
@@ -1,5 +1,5 @@
 #define PROBLEM "https://judge.yosupo.jp/problem/counting_primes"
-#include "../../other/template.hpp"
+#include "../../basic/template.hpp"
 #include "../../math/CountPrime.hpp"
 int main() {
 	lint N;

diff --git a/test/yosupo/discrete_logarithm_mod.cpp b/test/yosupo/discrete_logarithm_mod.cpp
@@ -1,5 +1,5 @@
 #define PROBLEM "https://judge.yosupo.jp/problem/discrete_logarithm_mod"
-#include "../../other/template.hpp"
+#include "../../basic/template.hpp"
 #include "../../math/DiscreteLogarithm.hpp"
 int main() {
 	int T, X, Y, M;

diff --git a/test/yosupo/exp_of_formal_power_series.test.cpp b/test/yosupo/exp_of_formal_power_series.test.cpp
@@ -1,5 +1,5 @@
 #define PROBLEM "https://judge.yosupo.jp/problem/exp_of_formal_power_series"
-#include "../../other/template.hpp"
+#include "../../basic/template.hpp"
 #include "../../math/StaticModInt.hpp"
 #include "../../math/FormalPowerSeries.hpp"
 

diff --git a/test/yosupo/factorize.test.cpp b/test/yosupo/factorize.test.cpp
@@ -1,5 +1,5 @@
 #define PROBLEM "https://judge.yosupo.jp/problem/factorize"
-#include "../../other/template.hpp"
+#include "../../basic/template.hpp"
 #include "../../math/FastFactorize.hpp"
 int main() {
 	int Q;

diff --git a/test/yosupo/inv_of_formal_power_series.test.cpp b/test/yosupo/inv_of_formal_power_series.test.cpp
@@ -1,5 +1,5 @@
 #define PROBLEM "https://judge.yosupo.jp/problem/inv_of_formal_power_series"
-#include "../../other/template.hpp"
+#include "../../basic/template.hpp"
 #include "../../math/StaticModInt.hpp"
 #include "../../math/FormalPowerSeries.hpp"
 

diff --git a/test/yosupo/lca.test.cpp b/test/yosupo/lca.test.cpp
@@ -1,6 +1,6 @@
 #define PROBLEM "https://judge.yosupo.jp/problem/lca"
 #include "../../graph/HeavyLightDecomposition.hpp"
-#include "../../other/template.hpp"
+#include "../../basic/template.hpp"
 int n, q;
 int main() {
 	scanf("%d%d", &n, &q);

diff --git a/test/yosupo/line_add_get_min_ConvexHullTrick.test.cpp b/test/yosupo/line_add_get_min_ConvexHullTrick.test.cpp
@@ -1,5 +1,5 @@
 #define PROBLEM "https://judge.yosupo.jp/problem/line_add_get_min"
-#include "../../other/template.hpp"
+#include "../../basic/template.hpp"
 #include "../../data-structure/ConvexHullTrick.hpp"
 int N, Q;
 int main() {

diff --git a/test/yosupo/line_add_get_min_LiChaoTree.test.cpp b/test/yosupo/line_add_get_min_LiChaoTree.test.cpp
@@ -1,6 +1,6 @@
 #define PROBLEM "https://judge.yosupo.jp/problem/line_add_get_min"
 #include "../../data-structure/LiChaoTree.hpp"
-#include "../../other/template.hpp"
+#include "../../basic/template.hpp"
 int n, q;
 lint a[200010], b[200010];
 std::vector<std::pair<int, lint>> vec;

diff --git a/test/yosupo/log_of_formal_power_series.test.cpp b/test/yosupo/log_of_formal_power_series.test.cpp
@@ -1,5 +1,5 @@
 #define PROBLEM "https://judge.yosupo.jp/problem/log_of_formal_power_series"
-#include "../../other/template.hpp"
+#include "../../basic/template.hpp"
 #include "../../math/StaticModInt.hpp"
 #include "../../math/FormalPowerSeries.hpp"
 

diff --git a/test/yosupo/many_aplusb.test.cpp b/test/yosupo/many_aplusb.test.cpp
@@ -1,6 +1,6 @@
 #define PROBLEM "https://judge.yosupo.jp/problem/many_aplusb"
-#include "../../other/template.hpp"
-#include "../../other/FastIO.hpp"
+#include "../../basic/template.hpp"
+#include "../../basic/FastIO.hpp"
 FastIO::Scanner cin;
 FastIO::Printer cout;
 int main() {

diff --git a/test/yosupo/matrix_det.test.cpp b/test/yosupo/matrix_det.test.cpp
@@ -1,5 +1,5 @@
 #define PROBLEM "https://judge.yosupo.jp/problem/matrix_det"
-#include "../../other/template.hpp"
+#include "../../basic/template.hpp"
 #include "../../math/StaticModInt.hpp"
 #include "../../math/Matrix.hpp"
 using ModInt = StaticModInt<998244353>;

diff --git a/test/yosupo/matrix_product.test.cpp b/test/yosupo/matrix_product.test.cpp
@@ -1,5 +1,5 @@
 #define PROBLEM "https://judge.yosupo.jp/problem/matrix_product"
-#include "../../other/template.hpp"
+#include "../../basic/template.hpp"
 #include "../../math/StaticModInt.hpp"
 #include "../../math/Matrix.hpp"
 using ModInt = StaticModInt<998244353>;

diff --git a/test/yosupo/point_add_range_sum.test.cpp b/test/yosupo/point_add_range_sum.test.cpp
@@ -1,6 +1,6 @@
 #define PROBLEM "https://judge.yosupo.jp/problem/point_add_range_sum"
 #include "../../data-structure/BIT.hpp"
-#include "../../other/template.hpp"
+#include "../../basic/template.hpp"
 int n, q, a;
 int main() {
 	scanf("%d%d", &n, &q);

diff --git a/test/yosupo/point_set_range_composite.test.cpp b/test/yosupo/point_set_range_composite.test.cpp
@@ -1,7 +1,7 @@
 #define PROBLEM "https://judge.yosupo.jp/problem/point_set_range_composite"
 #include "../../math/StaticModInt.hpp"
 #include "../../data-structure/SegTree.hpp"
-#include "../../other/template.hpp"
+#include "../../basic/template.hpp"
 using ModInt = StaticModInt<998244353>;
 using MP = std::pair<ModInt, ModInt>;
 MP nodef(const MP& lhs, const MP& rhs) {

diff --git a/test/yosupo/pow_of_formal_power_series.test.cpp b/test/yosupo/pow_of_formal_power_series.test.cpp
@@ -1,6 +1,6 @@
 #define PROBLEM "https://judge.yosupo.jp/problem/pow_of_formal_power_series"
-#include "../../other/template.hpp"
-#include "../../other/FastIO.hpp"
+#include "../../basic/template.hpp"
+#include "../../basic/FastIO.hpp"
 #include "../../math/StaticModInt.hpp"
 #include "../../math/FormalPowerSeries.hpp"
 

diff --git a/test/yosupo/predecessor_problem.test.cpp b/test/yosupo/predecessor_problem.test.cpp
@@ -1,6 +1,6 @@
 #define PROBLEM "https://judge.yosupo.jp/problem/predecessor_problem"
-#include "../../other/template.hpp"
-#include "../../other/FastIO.hpp"
+#include "../../basic/template.hpp"
+#include "../../basic/FastIO.hpp"
 #include "../../data-structure/vanEmdeBoasTree.hpp"
 FastIO::Scanner cin;
 FastIO::Printer cout;

diff --git a/test/yosupo/queue_operate_all_composite.test.cpp b/test/yosupo/queue_operate_all_composite.test.cpp
@@ -1,7 +1,7 @@
 #define PROBLEM "https://judge.yosupo.jp/problem/queue_operate_all_composite"
 #include "../../math/StaticModInt.hpp"
 #include "../../data-structure/SWAG.hpp"
-#include "../../other/template.hpp"
+#include "../../basic/template.hpp"
 using ModInt = StaticModInt<998244353>;
 using MP = std::pair<ModInt, ModInt>;
 MP op(const MP& lhs, const MP& rhs) {

diff --git a/test/yosupo/range_affine_range_sum.test.cpp b/test/yosupo/range_affine_range_sum.test.cpp
@@ -1,7 +1,7 @@
 #define PROBLEM "https://judge.yosupo.jp/problem/range_affine_range_sum"
 #include "../../math/StaticModInt.hpp"
 #include "../../data-structure/IntervalSegTree.hpp"
-#include "../../other/template.hpp"
+#include "../../basic/template.hpp"
 using ModInt = StaticModInt<998244353>;
 using MP = std::pair<ModInt, ModInt>;
 ModInt nodef(const ModInt& a, const ModInt& b) { return a + b; }

diff --git a/test/yosupo/range_chmin_chmax_add_range_sum.test.cpp b/test/yosupo/range_chmin_chmax_add_range_sum.test.cpp
@@ -1,7 +1,7 @@
 #define PROBLEM \
 	"https://judge.yosupo.jp/problem/range_chmin_chmax_add_range_sum"
 #include "../../data-structure/SegTreeBeats.hpp"
-#include "../../other/template.hpp"
+#include "../../basic/template.hpp"
 int n, q;
 int main() {
 	scanf("%d%d", &n, &q);

diff --git a/test/yosupo/range_kth_smallest.test.cpp b/test/yosupo/range_kth_smallest.test.cpp
@@ -1,6 +1,6 @@
 #define PROBLEM "https://judge.yosupo.jp/problem/range_kth_smallest"
-#include "../../other/template.hpp"
-#include "../../other/FastIO.hpp"
+#include "../../basic/template.hpp"
+#include "../../basic/FastIO.hpp"
 #include "../../data-structure/WaveletMatrix.hpp"
 FastIO::Scanner cin;
 FastIO::Printer cout;