Minimum Cuts to Divide a Circle
We can define the rules more succinctly:
 If ( n = 1 ), there’s no need to cut, so we return 0.
 If ( n ) is odd, we need to cut one by one, so we return ( n ).
 If ( n ) is even, we can cut on the diameter, effectively reducing the number of required cuts in half, so we return ( n / 2 ).
Here’s the code to reflect these rules:


This code will efficiently calculate the minimum number of cuts needed to divide the circle into ( n ) equal slices.