Update fenwick.md

mhayter · web-flow · commit 079b8ab41a18 · 2025-12-05T22:25:10.000-08:00
try messing with space.
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:
