another fix

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)
-const int mod = 998'244'353;
+constexpr 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)
-const int mod = 998'244'353;
+constexpr 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/math/fibonacci.hpp

@@ -11,7 +11,7 @@
 //! @endcode
 //! @time O(log n)
 //! @space O(log n)
-const int mod = 998'244'353;
+constexpr 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/n_choose_k/grow.hpp

@@ -1,5 +1,5 @@
 #pragma once
-const int mod = 17; //!< must be prime
+constexpr 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
-const int mod = 17; //!< composite ok
+constexpr 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
-const int mod = 998'244'353;
+constexpr int mod = 998'244'353;
 //! https://oeis.org/A000041
 //! @code
 //!   auto p = partitions(n);