rm constexpr from bare_mod_algebra for C++11 (#100)

hitonanode · web-flow · web-flow · commit 7b49f8149ba8 · 2021-09-05T19:07:53.000+09:00
* rm constexpr from bare_mod_algebra for C++11 * [auto-verifier] verify commit 693f7bb Co-authored-by: GitHub <noreply@github.com>
diff --git a/.verify-helper/timestamps.remote.json b/.verify-helper/timestamps.remote.json
@@ -100,11 +100,11 @@
 "linear_algebra_matrix/test/det_of_blackbox_matrix.test.cpp": "2021-09-04 00:38:32 +0900",
 "linear_algebra_matrix/test/inverse_matrix.test.cpp": "2021-07-23 11:30:53 +0900",
 "linear_algebra_matrix/test/linalg_bitset.test.cpp": "2021-06-13 19:08:25 +0900",
-"linear_algebra_matrix/test/linalg_ll_det.test.cpp": "2021-06-13 19:08:25 +0900",
-"linear_algebra_matrix/test/linalg_longlong.test.cpp": "2021-06-13 19:08:25 +0900",
-"linear_algebra_matrix/test/linalg_longlong_matmul.test.cpp": "2021-06-13 19:08:25 +0900",
+"linear_algebra_matrix/test/linalg_ll_det.test.cpp": "2021-09-05 18:58:09 +0900",
+"linear_algebra_matrix/test/linalg_longlong.test.cpp": "2021-09-05 18:58:09 +0900",
+"linear_algebra_matrix/test/linalg_longlong_matmul.test.cpp": "2021-09-05 18:58:09 +0900",
 "linear_algebra_matrix/test/linalg_modint_determinant.test.cpp": "2021-06-13 19:08:25 +0900",
-"linear_algebra_matrix/test/linalg_modint_multiplication.test.cpp": "2021-06-13 19:08:25 +0900",
+"linear_algebra_matrix/test/linalg_modint_multiplication.test.cpp": "2021-09-05 18:58:09 +0900",
 "linear_algebra_matrix/test/linalg_modint_pow.test.cpp": "2021-06-13 19:08:25 +0900",
 "linear_algebra_matrix/test/matrix_product.test.cpp": "2021-08-01 21:42:17 +0900",
 "linear_algebra_matrix/test/system_of_linear_equations.test.cpp": "2021-06-13 19:08:25 +0900",
@@ -173,6 +173,7 @@
 "tree/test/diameter.test.cpp": "2021-06-09 00:31:07 +0900",
 "tree/test/frequency_table_of_tree_distance.stress.test.cpp": "2021-09-04 01:18:16 +0900",
 "tree/test/frequency_table_of_tree_distance.test.cpp": "2021-09-04 01:18:16 +0900",
+"tree/test/frequency_table_of_tree_distance_ntt.test.cpp": "2021-09-05 18:58:09 +0900",
 "tree/test/hl_decomposition.test.cpp": "2021-06-06 15:23:40 +0900",
 "tree/test/lca.test.cpp": "2021-07-30 23:28:45 +0900",
 "tree/test/lca.yuki898.test.cpp": "2021-07-30 23:28:45 +0900",
diff --git a/number/bare_mod_algebra.hpp b/number/bare_mod_algebra.hpp
@@ -27,7 +27,7 @@ template <typename Int> Int mod_inverse(Int a, Int m) {
 
 // Require: 1 <= b
 // return: (g, x) s.t. g = gcd(a, b), xa = g MOD b, 0 <= x < b/g
-template <typename Int> constexpr std::pair<Int, Int> inv_gcd(Int a, Int b) {
+template <typename Int> /* constexpr */ std::pair<Int, Int> inv_gcd(Int a, Int b) {
     a %= b;
     if (a < 0) a += b;
     if (a == 0) return {b, 0};
@@ -42,7 +42,8 @@ template <typename Int> constexpr std::pair<Int, Int> inv_gcd(Int a, Int b) {
     return {s, m0};
 }
 
-template <typename Int> constexpr std::pair<Int, Int> crt(const std::vector<Int> &r, const std::vector<Int> &m) {
+template <typename Int>
+/* constexpr */ std::pair<Int, Int> crt(const std::vector<Int> &r, const std::vector<Int> &m) {
     assert(r.size() == m.size());
     int n = int(r.size());
     // Contracts: 0 <= r0 < m0
