fix

Author: lrvideckis

tests/library_checker_aizu_tests/handmade_tests/mod_int.test.cpp

@@ -5,9 +5,9 @@
 #include "../../../kactl/content/number-theory/euclid.h"
 // trick to remove const so I can use arbitrary prime mode
 // here
-#define const ;
+#define constexpr ;
 #include "../../../library/math/mod_int_pow.hpp"
-#undef const
+#undef constexpr
 int main() {
   cin.tie(0)->sync_with_stdio(0);
   mint val;

tests/library_checker_aizu_tests/math/binary_exponentiation_mod.test.cpp

@@ -3,9 +3,9 @@
 #include "../template.hpp"
 // trick to remove const so I can use arbitrary prime mode
 // here
-#define const ;
+#define constexpr ;
 #include "../../../library/math/mod_int_pow.hpp"
-#undef const
+#undef constexpr
 int main() {
   cin.tie(0)->sync_with_stdio(0);
   mod = 1'000'000'007;

tests/library_checker_aizu_tests/math/count_paths.test.cpp

@@ -1,10 +1,10 @@
 #define PROBLEM \
   "https://judge.yosupo.jp/problem/number_of_increasing_sequences_between_two_sequences"
 #include "../template.hpp"
-#define const ;
+#define constexpr ;
 #define mod mod_different_name
 #include "../../../library/math/n_choose_k/grow.hpp"
-#undef const
+#undef constexpr
 #undef mod
 #define mod mod_not_using
 #define modpow modpow_not_using

tests/library_checker_aizu_tests/math/mod_int_derangement.test.cpp

@@ -3,9 +3,9 @@
 #include "../template.hpp"
 // trick to remove const so I can use arbitrary prime mode
 // here
-#define const ;
+#define constexpr ;
 #include "../../../library/math/mod_int.hpp"
-#undef const
+#undef constexpr
 int main() {
   cin.tie(0)->sync_with_stdio(0);
   int n;

tests/library_checker_aizu_tests/math/mod_int_n_choose_k.test.cpp

@@ -3,9 +3,9 @@
 #include "../template.hpp"
 // trick to remove const so I can use arbitrary prime mode
 // here
-#define const ;
+#define constexpr ;
 #include "../../../library/math/mod_int.hpp"
-#undef const
+#undef constexpr
 int main() {
   cin.tie(0)->sync_with_stdio(0);
   int t;

tests/library_checker_aizu_tests/math/mod_int_tetration.test.cpp

@@ -4,9 +4,9 @@
 #include "../../../library/math/totient.hpp"
 // trick to remove const so I can use arbitrary prime mode
 // here
-#define const ;
+#define constexpr ;
 #include "../../../library/math/mod_int_pow.hpp"
-#undef const
+#undef constexpr
 int mod_int_tetration(int b, int e, int local_mod) {
   if (local_mod == 1) return 0;
   if (b == 0) return (e + 1) % 2 % local_mod;

tests/library_checker_aizu_tests/math/n_choose_k.test.cpp

@@ -3,9 +3,9 @@
 #include "../template.hpp"
 // trick to remove const so I can use arbitrary prime mode
 // here
-#define const ;
+#define constexpr ;
 #include "../../../library/math/n_choose_k/n_choose_k.hpp"
-#undef const
+#undef constexpr
 int main() {
   cin.tie(0)->sync_with_stdio(0);
   int num_tests;