diff options
Diffstat (limited to 'test/other')
| -rw-r--r-- | test/other/divideAndConquer.cpp | 8 | ||||
| -rw-r--r-- | test/other/knuth.cpp | 8 |
2 files changed, 8 insertions, 8 deletions
diff --git a/test/other/divideAndConquer.cpp b/test/other/divideAndConquer.cpp index a6fda9d..6d1b444 100644 --- a/test/other/divideAndConquer.cpp +++ b/test/other/divideAndConquer.cpp @@ -1,5 +1,5 @@ #include "../util.h" -constexpr ll inf = LL::INF; +constexpr ll INF = LL::INF; #include <other/divideAndConquer.cpp> vector<vector<ll>> gen(int n) { @@ -43,7 +43,7 @@ vector<vector<ll>> genQuick(int n) { } /*ll naive(int n, int m) { - vector<vector<ll>> state(m+1, vector<ll>(n+1, inf)); + vector<vector<ll>> state(m+1, vector<ll>(n+1, INF)); state[0][0] = 0; for (int i = 1; i <= m; i++) { for (int j = 1; j <= n; j++) { @@ -56,9 +56,9 @@ vector<vector<ll>> genQuick(int n) { }*/ vector<ll> naive(int n) { - vector<vector<ll>> state(n+1, vector<ll>(n+1, inf)); + vector<vector<ll>> state(n+1, vector<ll>(n+1, INF)); state[0][0] = 0; - vector<ll> res(n+1, inf); + vector<ll> res(n+1, INF); for (int i = 1; i <= n; i++) { for (int j = 1; j <= n; j++) { for (int k = 1; k <= j; k++) { diff --git a/test/other/knuth.cpp b/test/other/knuth.cpp index d469ceb..3462c0a 100644 --- a/test/other/knuth.cpp +++ b/test/other/knuth.cpp @@ -1,5 +1,5 @@ #include "../util.h" -constexpr ll inf = LL::INF; +constexpr ll iINFnf = LL::INF; #include <other/knuth.cpp> vector<vector<ll>> gen(int n) { @@ -43,7 +43,7 @@ vector<vector<ll>> genQuick(int n) { } /*ll naive(int n, int m, const vector<vector<ll>>& C) { - vector<vector<ll>> state(m+1, vector<ll>(n+1, inf)); + vector<vector<ll>> state(m+1, vector<ll>(n+1, INF)); state[0][0] = 0; for (int i = 1; i <= m; i++) { for (int j = 1; j <= n; j++) { @@ -56,9 +56,9 @@ vector<vector<ll>> genQuick(int n) { }*/ vector<ll> naive(int n, const vector<vector<ll>>& C) { - vector<vector<ll>> state(n+1, vector<ll>(n+1, inf)); + vector<vector<ll>> state(n+1, vector<ll>(n+1, INF)); state[0][0] = 0; - vector<ll> res(n+1, inf); + vector<ll> res(n+1, INF); for (int i = 1; i <= n; i++) { for (int j = 1; j <= n; j++) { for (int k = 1; k <= j; k++) { |