Shorten some lines that where to long

kth-competitive-programming · Mar 6, 2024 · ed4f762 · ed4f762
1 parent c52bac7
commit ed4f762
Show file tree

Hide file tree

Showing 3 changed files with 9 additions and 5 deletions.
diff --git a/content/graph/EdmondsKarp.h b/content/graph/EdmondsKarp.h
@@ -9,7 +9,8 @@
  */
 #pragma once
 
-template<class T> T edmondsKarp(vector<unordered_map<int, T>>& graph, int source, int sink) {
+template<class T> T edmondsKarp(vector<unordered_map<int, T>>&
+		graph, int source, int sink) {
 	assert(source != sink);
 	T flow = 0;
 	vi par(sz(graph)), q = par;

diff --git a/content/numerical/MatrixInverse-mod.h b/content/numerical/MatrixInverse-mod.h
@@ -26,7 +26,8 @@ int matInv(vector<vector<ll>>& A) {
 		return i;
 found:
 		A[i].swap(A[r]); tmp[i].swap(tmp[r]);
-		rep(j,0,n) swap(A[j][i], A[j][c]), swap(tmp[j][i], tmp[j][c]);
+		rep(j,0,n)
+			swap(A[j][i], A[j][c]), swap(tmp[j][i], tmp[j][c]);
 		swap(col[i], col[c]);
 		ll v = modpow(A[i][i], mod - 2);
 		rep(j,i+1,n) {
@@ -46,6 +47,6 @@ int matInv(vector<vector<ll>>& A) {
 	}
 
 	rep(i,0,n) rep(j,0,n)
-		A[col[i]][col[j]] = tmp[i][j] % mod + (tmp[i][j] < 0 ? mod : 0);
+		A[col[i]][col[j]] = tmp[i][j] % mod + (tmp[i][j] < 0)*mod;
 	return n;
 }
diff --git a/content/numerical/NumberTheoreticTransform.h b/content/numerical/NumberTheoreticTransform.h
@@ -42,12 +42,14 @@ void ntt(vl &a) {
 }
 vl conv(const vl &a, const vl &b) {
 	if (a.empty() || b.empty()) return {};
-	int s = sz(a) + sz(b) - 1, B = 32 - __builtin_clz(s), n = 1 << B;
+	int s = sz(a) + sz(b) - 1, B = 32 - __builtin_clz(s),
+	    n = 1 << B;
 	int inv = modpow(n, mod - 2);
 	vl L(a), R(b), out(n);
 	L.resize(n), R.resize(n);
 	ntt(L), ntt(R);
-	rep(i,0,n) out[-i & (n - 1)] = (ll)L[i] * R[i] % mod * inv % mod;
+	rep(i,0,n)
+		out[-i & (n - 1)] = (ll)L[i] * R[i] % mod * inv % mod;
 	ntt(out);
 	return {out.begin(), out.begin() + s};
 }