I like how the whole point of this coding problem is not to teach myself coding techniques, but to brush up on my high school geometry by digging into how to get from an arc length to a diagonal of a square to the length of the side of the square to an area of a square. Maybe post a link to the place where we can find all of the information we need to do this simple math problem? This problem is not difficult, finding the exact relations from an arc length to the get to an area of a square is just time consuming if you aren't looking in the correct places.

Why would a bitwise check pass the tests and fail the attempt? Seems like one of those things that either works or it doesn't.

That means the description is even worse than it initially appears. Nothing about this problem clearly states that we are counting how many red faces are generated per cut. See, I just did a better job right there... Even better would be to explain that by reiterating that the interior is blue.

Compile and calculate a solution on my own: Correct. Put the solution into this poorly made Kata: Wrong

Is this a test on understanding how C handles division of ints and floats, or is it a test on figuring out why your asserts throw out completely bogus results?