2 files changed, 54 insertions, 0 deletions
diff --git a/datastructures/test/fenwickTree.cpp b/datastructures/test/fenwickTree.cpp
new file mode 100644
index 0000000..4bc812a
--- /dev/null
+++ b/datastructures/test/fenwickTree.cpp
@@ -0,0 +1,26 @@
+#include "../fenwickTree.cpp"
+
+void test(int n) {
+	vector<ll> naive(n);
+	init(n);
+
+	for (int i = 0; i < 1000; i++) {
+		int p = util::randint(n);
+		ll delta = util::randint();
+		update(p, delta);
+		naive[p] += delta;
+
+		int r = util::randint(n+1) - 1;
+
+		ll naive_result = 0;
+		for (int i = 0; i <= r; i++) naive_result += naive[i];
+		ll fenwick_result = prefix_sum(r);
+		assert(naive_result == fenwick_result);
+	}
+}
+
+int main() {
+	test(1);
+	test(100);
+	test(1000);
+}
diff --git a/datastructures/test/fenwickTree2.cpp b/datastructures/test/fenwickTree2.cpp
new file mode 100644
index 0000000..359a5c4
--- /dev/null
+++ b/datastructures/test/fenwickTree2.cpp
@@ -0,0 +1,28 @@
+#include "../fenwickTree2.cpp"
+
+void test(int n) {
+	vector<ll> naive(n);
+	for (int i = 0; i < n; i++) naive[i] = util::randint();
+	init(naive);
+
+	for (int i = 0; i < 1000; i++) {
+		int l = util::randint(n), r = util::randint(n);
+		if (l > r) swap(l, r);
+		ll delta = util::randint();
+		update(l, r, delta);
+		for (int i = l; i < r; i++) naive[i] += delta;
+
+		r = util::randint(n+1) - 1;
+
+		ll naive_result = 0;
+		for (int i = 0; i <= r; i++) naive_result += naive[i];
+		ll fenwick_result = prefix_sum(r);
+		assert(naive_result == fenwick_result);
+	}
+}
+
+int main() {
+	test(1);
+	test(100);
+	test(1000);
+}