Leetcode 2481. Minimum Cuts to Divide a Circle

Compute the minimum number of straight cuts through the circle's center (diameters or radius-through-center lines) needed to split the circle into n equal congruent slices; key observation: answer is 0 for n=1, n/2 for even n, and n for odd n.