Problem 42460. The cake is a lie...
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!
Solution Stats
Problem Comments
-
4 Comments
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
Solution Comments
Show commentsProblem Recent Solvers24
Suggested Problems
-
Project Euler: Problem 9, Pythagorean numbers
1130 Solvers
-
Set the array elements whose value is 13 to 0
1351 Solvers
-
Get the elements of diagonal and antidiagonal for any m-by-n matrix
471 Solvers
-
Return a list sorted by number of consecutive occurrences
356 Solvers
-
Height of a right-angled triangle
1752 Solvers
More from this Author80
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!