Index: lib/dataStructure/segmentTree.cpp
==================================================================
--- lib/dataStructure/segmentTree.cpp
+++ lib/dataStructure/segmentTree.cpp
@@ -29,11 +29,10 @@
 			Node c = {l.sum + r.sum};
 			return c;
 		}
 		static Node Repeat(const Node& n, int k)
 		{
-			if(k==0) return Zero();
 			Node c = {n.sum * k};
 			return c;
 		}
 
 		bool lazy;