Merge pull request #333 from hitonanode/add-matrix-tests

Add matrix tests
hitonanode · May 3, 2024 · fcd5284 · fcd5284
2 parents dac6b5b + b12196a
commit fcd5284
Show file tree

Hide file tree

Showing 3 changed files with 54 additions and 0 deletions.
diff --git a/linear_algebra_matrix/test/matrix_determinant.test.cpp b/linear_algebra_matrix/test/matrix_determinant.test.cpp
@@ -0,0 +1,16 @@
+#define PROBLEM "https://judge.yosupo.jp/problem/matrix_det"
+#include "../../modint.hpp"
+#include "../matrix.hpp"
+#include <iostream>
+using namespace std;
+
+int main() {
+    cin.tie(nullptr);
+    ios::sync_with_stdio(false);
+
+    int N;
+    cin >> N;
+    matrix<ModInt<998244353>> M(N, N);
+    cin >> M;
+    cout << M.gauss_jordan().determinant_of_upper_triangle() << '\n';
+}
diff --git a/linear_algebra_matrix/test/matrix_pow.test.cpp b/linear_algebra_matrix/test/matrix_pow.test.cpp
@@ -0,0 +1,22 @@
+#define PROBLEM "https://judge.yosupo.jp/problem/pow_of_matrix"
+#include "../../modint.hpp"
+#include "../matrix.hpp"
+#include <iostream>
+using namespace std;
+
+int main() {
+    cin.tie(nullptr);
+    ios::sync_with_stdio(false);
+
+    int N;
+    long long K;
+    cin >> N >> K;
+    matrix<ModInt<998244353>> M(N, N);
+    cin >> M;
+    M = M.pow(K);
+    for (int i = 0; i < N; ++i) {
+        cout << M[i][0];
+        for (int j = 1; j < N; ++j) cout << ' ' << M[i][j];
+        cout << '\n';
+    }
+}
diff --git a/linear_algebra_matrix/test/matrix_rank.test.cpp b/linear_algebra_matrix/test/matrix_rank.test.cpp
@@ -0,0 +1,16 @@
+#define PROBLEM "https://judge.yosupo.jp/problem/matrix_rank"
+#include "../../modint.hpp"
+#include "../matrix.hpp"
+#include <iostream>
+using namespace std;
+
+int main() {
+    cin.tie(nullptr);
+    ios::sync_with_stdio(false);
+
+    int N, M;
+    cin >> N >> M;
+    matrix<ModInt<998244353>> mat(N, M);
+    cin >> mat;
+    cout << mat.gauss_jordan().rank_of_gauss_jordan() << '\n';
+}