Given number of cuts, find the maximum number of possible pieces.
This problem is nothing but The Lazy Caterer’s Problem and has below formula.
Maximum number of pieces = 1 + n*(n+1)/2
Refer this for proof.
This article is contributed by DANISH_RAZA. If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.
Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.
- Non-crossing lines to connect points in a circle
- Circle and Lattice Points
- Queries on count of points lie inside a circle
- Check whether a point exists in circle sector or not.
- Minimum lines to cover all points
- Program to find area of a circle
- Minimum revolutions to move center of a circle to a target
- Angular Sweep (Maximum points that can be enclosed in a circle of given radius)
- Number of Triangles that can be formed given a set of lines in Euclidean Plane
- Regular polygon using only 1s in a binary numbered circle
- Program for Point of Intersection of Two Lines
- Neighbors of a point on a circle using Bresenham's algorithm
- Count of obtuse angles in a circle with 'k' equidistant points between 2 given points
- Check whether given circle resides in boundary maintained by two other circles
- Check if a line touches or intersects a circle
- Find minimum radius such that atleast k point lie inside the circle
- Find intersection point of lines inside a section
- Program to find Circumference of a Circle
- Program to find smallest difference of angles of two parts of a given circle
- Number of parallelograms when n horizontal parallel lines intersect m vertical parallellines