From aca95353f22fb48fab74bf45de85f8badaa2e274 Mon Sep 17 00:00:00 2001
From: Yidi <noob999noob999@gmail.com>
Date: Fri, 6 Jun 2025 15:21:51 +0200
Subject: improve gauss + fix latex

---
 test/math/lgsFp.cpp | 13 +++----------
 1 file changed, 3 insertions(+), 10 deletions(-)

(limited to 'test/math')

diff --git a/test/math/lgsFp.cpp b/test/math/lgsFp.cpp
index e529390..d7680ea 100644
--- a/test/math/lgsFp.cpp
+++ b/test/math/lgsFp.cpp
@@ -3,7 +3,6 @@
 vector<vector<ll>> mat;
 constexpr ll mod = 1'000'000'007;
 namespace lgs {
-	int n, m;
 	#include <math/lgsFp.cpp>
 }
 
@@ -16,9 +15,7 @@ vector<vector<ll>> inverseMat(const vector<vector<ll>>& m) {
 		mat[i].resize(2*n);
 		mat[i][n+i] = 1;
 	}
-	lgs::n = sz(mat);
-	lgs::m = sz(mat[0]);
-	lgs::gauss();
+	lgs::gauss(sz(mat), sz(mat[0]));
 	vector<vector<ll>> res(m);
 	for (int i = 0; i < n; i++) {
 		res[i] = vector<ll>(mat[i].begin() + n, mat[i].end());
@@ -57,9 +54,7 @@ void test_square() {
 		vector<vector<ll>> m(n);
 		for (auto& v : m) v = Random::integers<ll>(n, 0, mod);
 		mat = m;
-		lgs::n = sz(mat);
-		lgs::m = sz(mat[0]);
-		lgs::gauss();
+		lgs::gauss(sz(mat), sz(mat[0]));
 
 		for (int i = 0; i < n; i++) {
 			for (int j = 0; j < n; j++) {
@@ -104,11 +99,9 @@ void performance_test() {
 	vector<vector<ll>> m(N);
 	for (auto& v : m) v = Random::integers<ll>(N, 0, mod);
 	mat = m;
-	lgs::n = sz(mat);
-	lgs::m = sz(mat[0]);
 
 	t.start();
-	lgs::gauss();
+	lgs::gauss(sz(mat), sz(mat[0]));
 	t.stop();
 	hash_t hash = 0;
 	for (int i = 0; i < N; i++) {
-- 
cgit v1.2.3