This works locally.

mhayter · mhayter · commit cbd2669a1998 · 2025-12-06T01:09:51.000-08:00
diff --git a/src/data_structures/fenwick.md b/src/data_structures/fenwick.md
@@ -165,38 +165,38 @@ Also this implementation supports two constructors.
 You can create a Fenwick tree initialized with zeros, or you can convert an existing array into the Fenwick form.
 
 === "C++"
-```{.cpp file=fenwick_sum}
-    struct FenwickTree {
-    	vector<int> bit;  // binary indexed tree
-    	int n;
-
-    	FenwickTree(int n) {
-    		this->n = n;
-    		bit.assign(n, 0);
-    	}
-
-    	FenwickTree(vector<int> const &a) : FenwickTree(a.size()) {
-    		for (size_t i = 0; i < a.size(); i++)
-    			add(i, a[i]);
-    	}
-
-    	int sum(int r) {
-    		int ret = 0;
-    		for (; r >= 0; r = (r & (r + 1)) - 1)
-    			ret += bit[r];
-    		return ret;
-    	}
-
-    	int sum(int l, int r) {
-    		return sum(r) - sum(l - 1);
-    	}
-
-    	void add(int idx, int delta) {
-    		for (; idx < n; idx = idx | (idx + 1))
-    			bit[idx] += delta;
-    	}
-    };
-```
+    ```{.cpp file=fenwick_sum}
+        struct FenwickTree {
+        	vector<int> bit;  // binary indexed tree
+        	int n;
+
+        	FenwickTree(int n) {
+        		this->n = n;
+        		bit.assign(n, 0);
+        	}
+
+        	FenwickTree(vector<int> const &a) : FenwickTree(a.size()) {
+        		for (size_t i = 0; i < a.size(); i++)
+        			add(i, a[i]);
+        	}
+
+        	int sum(int r) {
+        		int ret = 0;
+        		for (; r >= 0; r = (r & (r + 1)) - 1)
+        			ret += bit[r];
+        		return ret;
+        	}
+
+        	int sum(int l, int r) {
+        		return sum(r) - sum(l - 1);
+        	}
+
+        	void add(int idx, int delta) {
+        		for (; idx < n; idx = idx | (idx + 1))
+        			bit[idx] += delta;
+        	}
+        };
+    ```
 === "Python"
     ```py
     class FenwickTree:
@@ -253,35 +253,35 @@ Additionally, each time a value is `update`'d, the new value has to be smaller t
 Both significant limitations are because the $min$ operation together with the set of integers doesn't form a group, as there are no inverse elements.
 
 === "C++"
-```{.cpp file=fenwick_min}
-    struct FenwickTreeMin {
-    	vector<int> bit;
-    	int n;
-    	const int INF = (int)1e9;
-
-    	FenwickTreeMin(int n) {
-    		this->n = n;
-    		bit.assign(n, INF);
-    	}
-
-    	FenwickTreeMin(vector<int> a) : FenwickTreeMin(a.size()) {
-    		for (size_t i = 0; i < a.size(); i++)
-    			update(i, a[i]);
-    	}
-
-    	int getmin(int r) {
-    		int ret = INF;
-    		for (; r >= 0; r = (r & (r + 1)) - 1)
-    			ret = min(ret, bit[r]);
-    		return ret;
-    	}
-
-    	void update(int idx, int val) {
-    		for (; idx < n; idx = idx | (idx + 1))
-    			bit[idx] = min(bit[idx], val);
-    	}
-    };
-```
+    ```{.cpp file=fenwick_min}
+        struct FenwickTreeMin {
+        	vector<int> bit;
+        	int n;
+        	const int INF = (int)1e9;
+
+        	FenwickTreeMin(int n) {
+        		this->n = n;
+        		bit.assign(n, INF);
+        	}
+
+        	FenwickTreeMin(vector<int> a) : FenwickTreeMin(a.size()) {
+        		for (size_t i = 0; i < a.size(); i++)
+        			update(i, a[i]);
+        	}
+
+        	int getmin(int r) {
+        		int ret = INF;
+        		for (; r >= 0; r = (r & (r + 1)) - 1)
+        			ret = min(ret, bit[r]);
+        		return ret;
+        	}
+
+        	void update(int idx, int val) {
+        		for (; idx < n; idx = idx | (idx + 1))
+        			bit[idx] = min(bit[idx], val);
+        	}
+        };
+    ```
 === "Python"
     ```py
     class FenwickTreeMin:
