Lazy Caterer's sequence ~ KodeKnight
ProblemGiven a circular (or regular polygon) cake and a knife by which you can only cut vertically, find the maximum number of pieces of cake you can get by making n cuts. Write a program to do that.
Solution
The solution to this is very simple, if you know mathematics. :PRead full article from Lazy Caterer's sequence ~ KodeKnight
No comments:
Post a Comment