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
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++
#include<bits/stdc++.h>
using namespace std;
int findMaximumPieces( int n)
{
return 1 + n*(n+1)/2;
}
int main()
{
cout << findMaximumPieces(3);
return 0;
}
|
Java
class GFG {
static int findMaximumPieces( int n)
{
return 1 + n * (n + 1 ) / 2 ;
}
public static void main(String arg[])
{
System.out.print(findMaximumPieces( 3 ));
}
}
|
Python3
def findMaximumPieces(n):
return int ( 1 + n * (n + 1 ) / 2 )
print (findMaximumPieces( 3 ))
|
C#
using System;
class GFG {
static int findMaximumPieces( int n)
{
return 1 + n * (n + 1) / 2;
}
public static void Main()
{
Console.Write(findMaximumPieces(3));
}
}
|
PHP
<?php
function findMaximumPieces( $n )
{
return 1 + $n * ( $n + 1) / 2;
}
echo findMaximumPieces(3);
?>
|
Javascript
<script>
function findMaximumPieces(n)
{
return 1 + n * (n + 1) / 2;
}
document.write(findMaximumPieces(3));
</script>
|
Output:
7
Time Complexity: O(1)
Auxiliary Space: O(1)
Last Updated :
16 Jun, 2022
Like Article
Save Article
Share your thoughts in the comments
Please Login to comment...