Commit9bf36ea

authored

small typo corrected

1 parentf604589 commit9bf36eaCopy full SHA for 9bf36ea

File tree

-1

lines changed

-1

lines changed

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -323,7 +323,7 @@ In this problem we want to compute the GCD / LCM of all numbers of given ranges`
`323`	`323`
`324`	`324`	`This interesting variation of the Segment Tree can be solved in exactly the same way as the Segment Trees we derived for sum / minimum / maximum queries:`
`325`	`325`	`it is enough to store the GCD / LCM of the corresponding vertex in each vertex of the tree.`
`326`		`-Combining two vertices can be done by computing theGCM / LCM of both vertices.`
	`326`	`+Combining two vertices can be done by computing theGCD / LCM of both vertices.`
`327`	`327`
`328`	`328`	`####Counting the number of zeros, searching for the $k$-th zero {#counting-zero-search-kth data-toc-label="Counting the number of zeros, searching for the k-th zero"}`
`329`	`329`

Comments

(0)