Pizza cut problem (Or Circle Division by Lines)

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

Examples:

Input  : 2
Output : 4

Input  : 3
Output : 7

pizza-cut

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++

filter_none

edit
close

play_arrow

link
brightness_4
code

// 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


Java

filter_none

edit
close

play_arrow

link
brightness_4
code

// 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


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

C#

filter_none

edit
close

play_arrow

link
brightness_4
code

// 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


PHP

filter_none

edit
close

play_arrow

link
brightness_4
code

<?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



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.



My Personal Notes arrow_drop_up

Improved By : nitin mittal, 29AjayKumar



Article Tags :
Practice Tags :


1


Please write to us at contribute@geeksforgeeks.org to report any issue with the above content.