New syntax for problem URL

Author: adamant-pwn

verify/combi/binom.test.cpp

@@ -1,5 +1,5 @@
 // @brief Binomial Coefficient (Prime Mod)
-#define PROBLEM "https://judge.yosupo.jp/problem/binomial_coefficient_prime_mod"
+// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/binomial_coefficient_prime_mod
 #pragma GCC optimize("Ofast,unroll-loops")
 #define CP_ALGO_MAXN 1e7
 #include "cp-algo/number_theory/modint.hpp"

verify/geometry/arg.test.cpp

@@ -1,5 +1,5 @@
 // @brief Sort Points by Argument
-#define PROBLEM "https://judge.yosupo.jp/problem/sort_points_by_argument"
+// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/sort_points_by_argument
 #pragma GCC optimize("Ofast,unroll-loops")
 #pragma GCC target("tune=native")
 #include "cp-algo/geometry/point.hpp"

verify/geometry/closest_pair.test.cpp

@@ -1,5 +1,5 @@
 // @brief Closest Pair of Points
-#define PROBLEM "https://judge.yosupo.jp/problem/closest_pair"
+// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/closest_pair
 #pragma GCC optimize("Ofast,unroll-loops")
 #include "cp-algo/geometry/closest_pair.hpp"
 #include <bits/stdc++.h>

verify/geometry/hull.test.cpp

@@ -1,5 +1,5 @@
 // @brief Static Convex Hull
-#define PROBLEM "https://judge.yosupo.jp/problem/static_convex_hull"
+// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/static_convex_hull
 #pragma GCC optimize("Ofast,unroll-loops")
 #pragma GCC target("tune=native")
 #include "cp-algo/geometry/convex_hull.hpp"

verify/graph/cycle_directed.test.cpp

@@ -1,5 +1,5 @@
 // @brief Cycle Detection (Directed)
-#define PROBLEM "https://judge.yosupo.jp/problem/cycle_detection"
+// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/cycle_detection
 #pragma GCC optimize("Ofast,unroll-loops")
 #pragma GCC target("tune=native")
 #include "cp-algo/graph/cycle.hpp"

verify/graph/cycle_undirected.test.cpp

@@ -1,5 +1,5 @@
 // @brief Cycle Detection (Undirected)
-#define PROBLEM "https://judge.yosupo.jp/problem/cycle_detection_undirected"
+// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/cycle_detection_undirected
 #pragma GCC optimize("Ofast,unroll-loops")
 #pragma GCC target("tune=native")
 #include "cp-algo/graph/cycle.hpp"

verify/graph/euler_directed.test.cpp

@@ -1,5 +1,5 @@
 // @brief Eulerian Trail (Directed)
-#define PROBLEM "https://judge.yosupo.jp/problem/eulerian_trail_directed"
+// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/eulerian_trail_directed
 #pragma GCC optimize("Ofast,unroll-loops")
 #pragma GCC target("tune=native")
 #include "cp-algo/graph/euler.hpp"

verify/graph/euler_undirected.test.cpp

@@ -1,5 +1,5 @@
 // @brief Eulerian Trail (Undirected)
-#define PROBLEM "https://judge.yosupo.jp/problem/eulerian_trail_undirected"
+// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/eulerian_trail_undirected
 #pragma GCC optimize("Ofast,unroll-loops")
 #pragma GCC target("tune=native")
 #include "cp-algo/graph/euler.hpp"

verify/graph/mst.test.cpp

@@ -1,5 +1,5 @@
 // @brief Minimum Spanning Tree
-#define PROBLEM "https://judge.yosupo.jp/problem/minimum_spanning_tree"
+// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/minimum_spanning_tree
 #pragma GCC optimize("Ofast,unroll-loops")
 #include "cp-algo/graph/mst.hpp"
 #include <bits/stdc++.h>

verify/graph/shortest_path.test.cpp

@@ -1,5 +1,5 @@
 // @brief Shortest Path
-#define PROBLEM "https://judge.yosupo.jp/problem/shortest_path"
+// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/shortest_path
 #pragma GCC optimize("Ofast,unroll-loops")
 #include "cp-algo/graph/shortest_path.hpp"
 #include <bits/stdc++.h>

verify/linalg/adj.test.cpp

@@ -1,5 +1,5 @@
 // @brief Adjugate Matrix
-#define PROBLEM "https://judge.yosupo.jp/problem/adjugate_matrix"
+// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/adjugate_matrix
 #pragma GCC optimize("Ofast,unroll-loops")
 #include "cp-algo/linalg/matrix.hpp"
 #include <bits/stdc++.h>

verify/linalg/characteristic.test.cpp

@@ -1,5 +1,5 @@
 // @brief Characteristic Polynomial
-#define PROBLEM "https://judge.yosupo.jp/problem/characteristic_polynomial"
+// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/characteristic_polynomial
 #pragma GCC optimize("Ofast,unroll-loops")
 //#pragma GCC target("tune=native")
 #define CP_ALGO_MAXN 1 << 10

verify/linalg/det.test.cpp

@@ -1,5 +1,5 @@
 // @brief Matrix Determinant
-#define PROBLEM "https://judge.yosupo.jp/problem/matrix_det"
+// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/matrix_det
 #pragma GCC optimize("Ofast,unroll-loops")
 #pragma GCC target("tune=native")
 #include "cp-algo/linalg/matrix.hpp"

verify/linalg/euler_circs.test.cpp

@@ -1,5 +1,5 @@
 // @brief Counting Eulerian Circuits
-#define PROBLEM "https://judge.yosupo.jp/problem/counting_eulerian_circuits"
+// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/counting_eulerian_circuits
 #pragma GCC optimize("Ofast,unroll-loops")
 #pragma GCC target("tune=native")
 #include "cp-algo/math/combinatorics.hpp"

verify/linalg/inv.test.cpp

@@ -1,5 +1,5 @@
 // @brief Inverse Matrix
-#define PROBLEM "https://judge.yosupo.jp/problem/inverse_matrix"
+// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/inverse_matrix
 #pragma GCC optimize("Ofast,unroll-loops")
 #include "cp-algo/linalg/matrix.hpp"
 #include <bits/stdc++.h>

verify/linalg/pow.test.cpp

@@ -1,5 +1,5 @@
 // @brief Pow of Matrix
-#define PROBLEM "https://judge.yosupo.jp/problem/pow_of_matrix"
+// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/pow_of_matrix
 #pragma GCC optimize("Ofast,unroll-loops")
 #pragma GCC target("tune=native")
 #include "cp-algo/linalg/matrix.hpp"

verify/linalg/pow_fast.test.cpp

@@ -1,5 +1,5 @@
 // @brief Pow of Matrix (Frobenius)
-#define PROBLEM "https://judge.yosupo.jp/problem/pow_of_matrix"
+// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/pow_of_matrix
 #pragma GCC optimize("Ofast,unroll-loops")
 #define CP_ALGO_MAXN 256
 #include "cp-algo/linalg/frobenius.hpp"

verify/linalg/prod.test.cpp

@@ -1,5 +1,5 @@
 // @brief Matrix Product
-#define PROBLEM "https://judge.yosupo.jp/problem/matrix_product"
+// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/matrix_product
 #pragma GCC optimize("Ofast,unroll-loops")
 #include "cp-algo/linalg/matrix.hpp"
 #include <bits/stdc++.h>

verify/linalg/prod_dynamic_modint.test.cpp

@@ -1,5 +1,5 @@
 // @brief Matrix Product (dynamic modint)
-#define PROBLEM "https://judge.yosupo.jp/problem/matrix_product"
+// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/matrix_product
 #pragma GCC optimize("Ofast,unroll-loops")
 #pragma GCC target("tune=native")
 #include "cp-algo/linalg/matrix.hpp"

verify/linalg/rank.test.cpp

@@ -1,5 +1,5 @@
 // @brief Rank of Matrix
-#define PROBLEM "https://judge.yosupo.jp/problem/matrix_rank"
+// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/matrix_rank
 #pragma GCC optimize("Ofast,unroll-loops")
 #pragma GCC target("tune=native")
 #include "cp-algo/linalg/matrix.hpp"

verify/linalg/spanning_directed.test.cpp

@@ -1,5 +1,5 @@
 // @brief Counting Spanning Trees (Directed)
-#define PROBLEM "https://judge.yosupo.jp/problem/counting_spanning_tree_directed"
+// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/counting_spanning_tree_directed
 #pragma GCC optimize("Ofast,unroll-loops")
 #pragma GCC target("tune=native")
 #include "cp-algo/linalg/matrix.hpp"

verify/linalg/spanning_undirected.test.cpp

@@ -1,5 +1,5 @@
 // @brief Counting Spanning Trees (Undirected)
-#define PROBLEM "https://judge.yosupo.jp/problem/counting_spanning_tree_undirected"
+// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/counting_spanning_tree_undirected
 #pragma GCC optimize("Ofast,unroll-loops")
 #pragma GCC target("tune=native")
 #include "cp-algo/linalg/matrix.hpp"

verify/linalg/system.test.cpp

@@ -1,5 +1,5 @@
 // @brief System of Linear Equations
-#define PROBLEM "https://judge.yosupo.jp/problem/system_of_linear_equations"
+// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/system_of_linear_equations
 #pragma GCC optimize("Ofast,unroll-loops")
 #pragma GCC target("tune=native")
 #include "cp-algo/linalg/matrix.hpp"

verify/linalg/tutte.test.cpp

@@ -1,5 +1,5 @@
 // @brief Matching on General Graph (Tutte matrix)
-#define PROBLEM "https://judge.yosupo.jp/problem/general_matching"
+// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/general_matching
 #pragma GCC optimize("Ofast,unroll-loops")
 #pragma GCC target("tune=native")
 #include "cp-algo/linalg/matrix.hpp"

verify/number_theory/discrete_log.test.cpp

@@ -1,5 +1,5 @@
 // @brief Discrete Logarithm
-#define PROBLEM "https://judge.yosupo.jp/problem/discrete_logarithm_mod"
+// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/discrete_logarithm_mod
 #pragma GCC optimize("Ofast,unroll-loops")
 #include "cp-algo/number_theory/discrete_log.hpp"
 #include <bits/stdc++.h>

verify/number_theory/factorize.test.cpp

@@ -1,5 +1,5 @@
 // @brief Factorize
-#define PROBLEM "https://judge.yosupo.jp/problem/factorize"
+// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/factorize
 #pragma GCC optimize("Ofast,unroll-loops")
 #include "cp-algo/number_theory/factorize.hpp"
 #include <bits/stdc++.h>

verify/number_theory/modsqrt.test.cpp

@@ -1,5 +1,5 @@
 // @brief Sqrt Mod
-#define PROBLEM "https://judge.yosupo.jp/problem/sqrt_mod"
+// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/sqrt_mod
 #pragma GCC optimize("Ofast,unroll-loops")
 #pragma GCC target("tune=native")
 #include "cp-algo/number_theory/discrete_sqrt.hpp"

verify/number_theory/primality.test.cpp

@@ -1,5 +1,5 @@
 // @brief Primality Test
-#define PROBLEM "https://judge.yosupo.jp/problem/primality_test"
+// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/primality_test
 #pragma GCC optimize("Ofast,unroll-loops")
 #include "cp-algo/number_theory/primality.hpp"
 #include <bits/stdc++.h>

verify/number_theory/primitive_root.test.cpp

@@ -1,5 +1,5 @@
 // @brief Primitive Root
-#define PROBLEM "https://judge.yosupo.jp/problem/primitive_root"
+// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/primitive_root
 #pragma GCC optimize("Ofast,unroll-loops")
 #pragma GCC target("tune=native")
 #include "cp-algo/number_theory/euler.hpp"

verify/number_theory/two_squares.test.cpp

@@ -1,5 +1,5 @@
 // @brief Represent A Number As Two Square Sum
-#define PROBLEM "https://judge.yosupo.jp/problem/two_square_sum"
+// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/two_square_sum
 #pragma GCC optimize("Ofast,unroll-loops")
 #include "cp-algo/number_theory/two_squares.hpp"
 #include <bits/stdc++.h>

verify/poly/bell.test.cpp

@@ -1,5 +1,5 @@
 // @brief Bell Number
-#define PROBLEM "https://judge.yosupo.jp/problem/bell_number"
+// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/bell_number
 #pragma GCC optimize("Ofast,unroll-loops")
 #include "cp-algo/math/poly.hpp"
 #include <bits/stdc++.h>

verify/poly/convolution107.test.cpp

@@ -1,5 +1,5 @@
 // @brief Convolution mod $10^9+7$
-#define PROBLEM "https://judge.yosupo.jp/problem/convolution_mod_1000000007"
+// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/convolution_mod_1000000007
 #pragma GCC optimize("Ofast,unroll-loops")
 #define CP_ALGO_CHECKPOINT
 #include <bits/stdc++.h>

verify/poly/div.test.cpp

@@ -1,5 +1,5 @@
 // @brief Division of Polynomials
-#define PROBLEM "https://judge.yosupo.jp/problem/division_of_polynomials"
+// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/division_of_polynomials
 #include "cp-algo/math/poly.hpp"
 #include <bits/stdc++.h>
 

verify/poly/exp.test.cpp

@@ -1,5 +1,5 @@
 // @brief Exp of Power Series
-#define PROBLEM "https://judge.yosupo.jp/problem/exp_of_formal_power_series"
+// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/exp_of_formal_power_series
 #pragma GCC optimize("Ofast,unroll-loops")
 #include "cp-algo/math/poly.hpp"
 #include <bits/stdc++.h>

verify/poly/find_linrec.test.cpp

@@ -1,5 +1,5 @@
 // @brief Find Linear Recurrence
-#define PROBLEM "https://judge.yosupo.jp/problem/find_linear_recurrence"
+// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/find_linear_recurrence
 #include "cp-algo/math/poly.hpp"
 #include <bits/stdc++.h>
 

verify/poly/inter.test.cpp

@@ -1,5 +1,5 @@
 // @brief Polynomial Interpolation
-#define PROBLEM "https://judge.yosupo.jp/problem/polynomial_interpolation"
+// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/polynomial_interpolation
 #include "cp-algo/math/poly.hpp"
 #include <bits/stdc++.h>
 

verify/poly/inter_geo.test.cpp

@@ -1,5 +1,5 @@
 // @brief Polynomial Interpolation (Geometric Sequence)
-#define PROBLEM "https://judge.yosupo.jp/problem/polynomial_interpolation_on_geometric_sequence"
+// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/polynomial_interpolation_on_geometric_sequence
 #pragma GCC optimize("Ofast,unroll-loops")
 #include "cp-algo/math/poly.hpp"
 #include <bits/stdc++.h>

verify/poly/inv.test.cpp

@@ -1,5 +1,5 @@
 // @brief Inv of Power Series
-#define PROBLEM "https://judge.yosupo.jp/problem/inv_of_formal_power_series"
+// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/inv_of_formal_power_series
 #pragma GCC optimize("Ofast,unroll-loops")
 #include "cp-algo/math/poly.hpp"
 #include <bits/stdc++.h>

verify/poly/inv_mod.test.cpp

@@ -1,5 +1,5 @@
 // @brief Inv of Polynomials
-#define PROBLEM "https://judge.yosupo.jp/problem/inv_of_polynomials"
+// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/inv_of_polynomials
 #include "cp-algo/math/poly.hpp"
 #include <bits/stdc++.h>
 

verify/poly/linrec_consecutive.test.cpp

@@ -1,5 +1,5 @@
 // @brief Consecutive Terms of Linear Recursion
-#define PROBLEM "https://judge.yosupo.jp/problem/consecutive_terms_of_linear_recurrent_sequence"
+// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/consecutive_terms_of_linear_recurrent_sequence
 #pragma GCC optimize("Ofast,unroll-loops")
 #include "cp-algo/math/poly.hpp"
 #include <bits/stdc++.h>

verify/poly/linrec_single.test.cpp

@@ -1,5 +1,5 @@
 // @brief Kth term of Linearly Recurrent Sequence
-#define PROBLEM "https://judge.yosupo.jp/problem/kth_term_of_linearly_recurrent_sequence"
+// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/kth_term_of_linearly_recurrent_sequence
 #pragma GCC optimize("Ofast,unroll-loops")
 #include "cp-algo/math/poly.hpp"
 #include <bits/stdc++.h>

verify/poly/log.test.cpp

@@ -1,5 +1,5 @@
 // @brief Log of Power Series
-#define PROBLEM "https://judge.yosupo.jp/problem/log_of_formal_power_series"
+// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/log_of_formal_power_series
 #pragma GCC optimize("Ofast,unroll-loops")
 #include "cp-algo/math/poly.hpp"
 #include <bits/stdc++.h>

verify/poly/multieval.test.cpp

@@ -1,5 +1,5 @@
 // @brief Multipoint Evaluation
-#define PROBLEM "https://judge.yosupo.jp/problem/multipoint_evaluation"
+// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/multipoint_evaluation
 #pragma GCC optimize("Ofast,unroll-loops")
 #include "cp-algo/math/poly.hpp"
 #include <bits/stdc++.h>

verify/poly/multieval_geo.test.cpp

@@ -1,5 +1,5 @@
 // @brief Multipoint Evaluation (Geometric Sequence)
-#define PROBLEM "https://judge.yosupo.jp/problem/multipoint_evaluation_on_geometric_sequence"
+// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/multipoint_evaluation_on_geometric_sequence
 #pragma GCC optimize("Ofast,unroll-loops")
 #include "cp-algo/math/poly.hpp"
 #include <bits/stdc++.h>

verify/poly/pow.test.cpp

@@ -1,5 +1,5 @@
 // @brief Pow of Power Series
-#define PROBLEM "https://judge.yosupo.jp/problem/pow_of_formal_power_series"
+// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/pow_of_formal_power_series
 #pragma GCC optimize("Ofast,unroll-loops")
 #include "cp-algo/math/poly.hpp"
 #include <bits/stdc++.h>

verify/poly/prod_sequence.test.cpp

@@ -1,5 +1,5 @@
 // @brief Product of Polynomial Sequence
-#define PROBLEM "https://judge.yosupo.jp/problem/product_of_polynomial_sequence"
+// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/product_of_polynomial_sequence
 #pragma GCC optimize("Ofast,unroll-loops")
 #include "cp-algo/math/poly.hpp"
 #include <bits/stdc++.h>

verify/poly/roots.test.cpp

@@ -1,5 +1,5 @@
 // @brief Polynomial Root Finding
-#define PROBLEM "https://judge.yosupo.jp/problem/polynomial_root_finding"
+// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/polynomial_root_finding
 #include "cp-algo/math/poly.hpp"
 #include <bits/stdc++.h>
 

verify/poly/sampling.test.cpp

@@ -1,5 +1,5 @@
 // @brief Shift of Sampling Points of Polynomial
-#define PROBLEM "https://judge.yosupo.jp/problem/shift_of_sampling_points_of_polynomial"
+// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/shift_of_sampling_points_of_polynomial
 #define CP_ALGO_MAXN 1 << 20
 #pragma GCC optimize("Ofast,unroll-loops")
 #include "cp-algo/math/poly.hpp"

verify/poly/sqrt.test.cpp

@@ -1,5 +1,5 @@
 // @brief Sqrt of Power Series
-#define PROBLEM "https://judge.yosupo.jp/problem/sqrt_of_formal_power_series"
+// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/sqrt_of_formal_power_series
 #include "cp-algo/math/poly.hpp"
 #include "cp-algo/number_theory/modint.hpp"
 #include <bits/stdc++.h>

verify/poly/taylor.test.cpp

@@ -1,5 +1,5 @@
 // @brief Polynomial Taylor Shift
-#define PROBLEM "https://judge.yosupo.jp/problem/polynomial_taylor_shift"
+// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/polynomial_taylor_shift
 #pragma GCC optimize("Ofast,unroll-loops")
 #pragma GCC target("tune=native")
 #include "cp-algo/math/poly.hpp"

verify/poly/wildcard.test.cpp

@@ -1,5 +1,5 @@
 // @brief Wildcard Pattern Matching
-#define PROBLEM "https://judge.yosupo.jp/problem/wildcard_pattern_matching"
+// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/wildcard_pattern_matching
 #pragma GCC optimize("Ofast,unroll-loops")
 #define CP_ALGO_CHECKPOINT
 #include "cp-algo/math/cvector.hpp"

verify/string/eertree.test.cpp

@@ -1,5 +1,5 @@
 // @brief Eertree
-#define PROBLEM "https://judge.yosupo.jp/problem/eertree"
+// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/eertree
 #pragma GCC optimize("Ofast,unroll-loops")
 #pragma GCC target("tune=native")
 #include "cp-algo/structures/eertree.hpp"

verify/structures/bitpack/det_mod_2.test.cpp

@@ -1,6 +1,6 @@
 
 // @brief Determinant of Matrix (Mod 2)
-#define PROBLEM "https://judge.yosupo.jp/problem/matrix_det_mod_2"
+// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/matrix_det_mod_2
 #pragma GCC optimize("Ofast,unroll-loops")
 #pragma GCC target("tune=native")
 #include "cp-algo/structures/bitpack.hpp"

verify/structures/bitpack/inv_mod_2.test.cpp

@@ -1,5 +1,5 @@
 // @brief Inverse Matrix (Mod 2)
-#define PROBLEM "https://judge.yosupo.jp/problem/inverse_matrix_mod_2"
+// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/inverse_matrix_mod_2
 #pragma GCC optimize("Ofast,unroll-loops")
 #include "cp-algo/structures/bitpack.hpp"
 #include <bits/stdc++.h>

verify/structures/bitpack/prod_mod_2.test.cpp

@@ -1,6 +1,6 @@
 
 // @brief Matrix Product (Mod 2)
-#define PROBLEM "https://judge.yosupo.jp/problem/matrix_product_mod_2"
+// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/matrix_product_mod_2
 #pragma GCC optimize("Ofast,unroll-loops")
 #pragma GCC target("tune=native")
 #include "cp-algo/structures/bitpack.hpp"

verify/structures/bitpack/system_mod_2.test.cpp

@@ -1,5 +1,5 @@
 // @brief System of Linear Equations (Mod 2)
-#define PROBLEM "https://judge.yosupo.jp/problem/system_of_linear_equations_mod_2"
+// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/system_of_linear_equations_mod_2
 #pragma GCC optimize("Ofast,unroll-loops")
 #include "cp-algo/structures/bitpack.hpp"
 #include <bits/stdc++.h>