You're hosting a birthday party with a large number of screaming children. Fortunately, you have a gigantic sheet cake in front of you that can be cut a large number of times. Given the number of kids at the party, find the minimum number of cuts you need to make to give all of them at least one piece. There can be pieces left over, but you need to make sure that everyone gets at least one piece. Fortunately, the pieces of cake don't have to be the same size.
Good luck!
for those detail-oriented (i.e. picky) I imagine cuts need to be straight lines, and the cake is two-dimensional?
You're half right: the cuts have to be straight. The cake is 3-D, though. Assume the cake is a rectangular solid, and all cuts are planar.
thanks for the clarification!
death^H^H^H^Hservings by a thousand cuts
It's about time you learned how to cheat properly, Corneli. I was wondering how many more switch/case and if/then solutions you were going to submit...
360 Solvers
568 Solvers
How to find the position of an element in a vector without using the find function
2236 Solvers
Getting the indices from a vector
937 Solvers
162 Solvers