Given number of cuts, find the maximum number of possible pieces.

**Examples:**

Input : 2 Output : 4 Input : 3 Output : 7

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.

## C++

`// C++ program to find maximum no of pieces ` `// by given number of cuts ` `#include<bits/stdc++.h> ` `using` `namespace` `std; ` ` ` `// Function for finding maximum pieces ` `// with n cuts. ` `int` `findMaximumPieces(` `int` `n) ` `{ ` ` ` `return` `1 + n*(n+1)/2; ` `} ` ` ` `// Driver code ` `int` `main() ` `{ ` ` ` `cout << findMaximumPieces(3); ` ` ` `return` `0; ` `} ` |

*chevron_right*

*filter_none*

## Java

`// Java program to find maximum no of ` `// pieces by given number of cuts ` `class` `GFG { ` ` ` ` ` `// Function for finding maximum pieces ` ` ` `// with n cuts. ` ` ` `static` `int` `findMaximumPieces(` `int` `n) ` ` ` `{ ` ` ` `return` `1` `+ n * (n + ` `1` `) / ` `2` `; ` ` ` `} ` ` ` ` ` `// Driver Program to test above function ` ` ` `public` `static` `void` `main(String arg[]) ` ` ` `{ ` ` ` ` ` `System.out.print(findMaximumPieces(` `3` `)); ` ` ` `} ` `} ` ` ` `// This code is contributed by Anant Agarwal. ` |

*chevron_right*

*filter_none*

## Python3

`# Python3 program to find maximum ` `# no. of pieces by given ` `# number of cuts ` ` ` `# Function for finding maximum ` `# pieces with n cuts. ` `def` `findMaximumPieces(n): ` ` ` `return` `int` `(` `1` `+` `n ` `*` `(n ` `+` `1` `) ` `/` `2` `) ` ` ` `# Driver code ` `print` `(findMaximumPieces(` `3` `)) ` ` ` `# This code is contributed 29AjayKumar ` |

*chevron_right*

*filter_none*

## C#

`// C# program to find maximum no of ` `// pieces by given number of cuts ` `using` `System; ` ` ` `class` `GFG { ` ` ` ` ` `// Function for finding maximum pieces ` ` ` `// with n cuts. ` ` ` `static` `int` `findMaximumPieces(` `int` `n) ` ` ` `{ ` ` ` `return` `1 + n * (n + 1) / 2; ` ` ` `} ` ` ` ` ` `// Driver Program to test above function ` ` ` `public` `static` `void` `Main() ` ` ` `{ ` ` ` ` ` `Console.Write(findMaximumPieces(3)); ` ` ` `} ` `} ` ` ` `// This code is contributed by nitin mittal. ` |

*chevron_right*

*filter_none*

## PHP

`<?php ` `// PHP program to find maximum ` `// no. of pieces by given ` `// number of cuts ` ` ` `// Function for finding maximum ` `// pieces with n cuts. ` `function` `findMaximumPieces(` `$n` `) ` `{ ` ` ` `return` `1 + ` `$n` `* (` `$n` `+ 1) / 2; ` `} ` ` ` `// Driver code ` `echo` `findMaximumPieces(3); ` ` ` `// This code is contributed by nitin mittal. ` `?> ` |

*chevron_right*

*filter_none*

**Output:**

7

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 contribute@geeksforgeeks.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.

## Recommended Posts:

- Non-crossing lines to connect points in a circle
- Program to calculate area of inner circle which passes through center of outer circle and touches its circumference
- Equation of circle when three points on the circle are given
- Check if a circle lies inside another circle or not
- Angle subtended by the chord to center of the circle when the angle subtended by the another equal chord of a congruent circle is given
- Find area of the larger circle when radius of the smaller circle and difference in the area is given
- Area of the circle that has a square and a circle inscribed in it
- Paper Cut into Minimum Number of Squares
- Minimum squares to evenly cut a rectangle
- Maximum given sized rectangles that can be cut out of a sheet of paper
- Minimum lines to cover all points
- Number of Triangles that can be formed given a set of lines in Euclidean Plane
- Program for Point of Intersection of Two Lines
- Find intersection point of lines inside a section
- Number of parallelograms when n horizontal parallel lines intersect m vertical parallellines
- Count of different straight lines with total n points with m collinear
- Check if three straight lines are concurrent or not
- Maximum distinct lines passing through a single point
- Maximum points of intersection n lines
- Check whether two straight lines are orthogonal or not