revert constexpr -> const as it was causing build issues

Author: lrvideckis

library/convolution/gcd_convolution.hpp

@@ -7,7 +7,7 @@
 //!   for all pairs (i,j) where gcd(i,j)==k
 //! @time O(n log n)
 //! @space O(n)
-constexpr int mod = 998'244'353;
+const int mod = 998'244'353;
 vi gcd_convolution(const vi& a, const vi& b) {
   int n = sz(a);
   vi c(n);

library/convolution/lcm_convolution.hpp

@@ -7,7 +7,7 @@
 //!   for all pairs (i,j) where lcm(i,j)==k
 //! @time O(n log n)
 //! @space O(n)
-constexpr int mod = 998'244'353;
+const int mod = 998'244'353;
 vi lcm_convolution(const vi& a, const vi& b) {
   int n = sz(a);
   vector<ll> sum_a(n), sum_b(n);

library/data_structures/seg_tree_uncommon/implicit.hpp

@@ -8,7 +8,7 @@ template<int N> struct implicit_seg_tree {
     if (l[0] == r[0]) return {l[0], l[1] + r[1]};
     return min(l, r);
   }
-  static constexpr dt unit{LLONG_MAX, 0LL};
+  static const dt unit{LLONG_MAX, 0LL};
   struct node {
     dt num;
     ll lazy = 0;

library/math/fibonacci.hpp

@@ -11,7 +11,7 @@
 //! @endcode
 //! @time O(log n)
 //! @space O(log n)
-constexpr int mod = 998'244'353;
+const int mod = 998'244'353;
 array<ll, 2> fib(ll n) {
   if (n == 0) return {0LL, 1LL};
   auto [x, y] = fib(n >> 1);

library/math/mod_int.hpp

@@ -1,5 +1,5 @@
 #pragma once
-constexpr int mod = 998244353;
+const int mod = 998244353;
 //! https://github.com/kth-competitive-programming/kactl/blob/main/content/number-theory/ModularArithmetic.h
 //! https://codeforces.com/blog/entry/122714
 struct mint {

library/math/n_choose_k/grow.hpp

@@ -1,5 +1,5 @@
 #pragma once
-constexpr int mod = 17; //!< must be prime
+const int mod = 17; //!< must be prime
 struct comb {
   ll inv = 1, fact = 1, inv_fact = 1;
 };

library/math/n_choose_k/pascals_identity.hpp

@@ -1,5 +1,5 @@
 #pragma once
-constexpr int mod = 17; //!< composite ok
+const int mod = 17; //!< composite ok
 vector<vector<ll>> ch(1010); //!< ch[n][k] = n choose k
 rep(i, 0, sz(ch)) {
   ch[i].resize(i + 1, 1);

library/math/partitions.hpp

@@ -1,5 +1,5 @@
 #pragma once
-constexpr int mod = 998'244'353;
+const int mod = 998'244'353;
 //! https://oeis.org/A000041
 //! @code
 //!   auto p = partitions(n);

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 constexpr ;
+#define const ;
 #include "../../../library/math/mod_int_pow.hpp"
-#undef constexpr
+#undef const
 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 constexpr ;
+#define const ;
 #include "../../../library/math/mod_int_pow.hpp"
-#undef constexpr
+#undef const
 int main() {
   cin.tie(0)->sync_with_stdio(0);
   mod = 1'000'000'007;