Skip to content
Related Articles

Related Articles

Table of Contents

Improve Article
Save Article
Like Article

Maximum number of pieces in N cuts

  • Difficulty Level : Medium
  • Last Updated : 20 Apr, 2021

Given a square piece and a total number of cuts available n, Find out the maximum number of rectangular or square pieces of equal size that can be obtained with n cuts. The allowed cuts are horizontal and vertical cut. 
Note: Stacking and folding is not allowed.
Examples: 
 

Input : n = 1
Output : 2
Explanation : 

Input : n = 2
Output : 4
Explanation : 

Input : n = 3
Output : 6
Explanation : 

 

Given is n which is the number of allowed cuts. As it is required to maximize number of pieces after n cuts, So number of horizontal cuts will be equal to number of vertical cuts. This can be prove using differentiation. So number of horizontal cut will be n/2. and vertical cuts will be n-n/2.
So number of pieces = (horizontal cut + 1) * (vertical cut + 1).
Program: 
 

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)
{
    // to maximize number of pieces
    // x is the horizontal cuts
    int x = n / 2;
 
    // Now (x) is the horizontal cuts
    // and (n-x) is vertical cuts, then
    // maximum number of pieces = (x+1)*(n-x+1)
    return ((x + 1) * (n - x + 1));
}
 
// Driver code
int main()
{
 
    // Taking the maximum number of cuts allowed as 3
    int n = 3;
 
    // Finding and printing the max number of pieces
    cout << "Max number of pieces for n = " << n
         << " is " << findMaximumPieces(3);
 
    return 0;
}
Java



// Java program to find maximum
// no of pieces by given number
// of cuts
import java.util.*;
 
class GFG
{
// Function for finding maximum
// pieces with n cuts.
public static int findMaximumPieces(int n)
{
    // to maximize number of pieces
    // x is the horizontal cuts
    int x = n / 2;
 
    // Now (x) is the horizontal cuts
    // and (n-x) is vertical cuts, then
    // maximum number of pieces = (x+1)*(n-x+1)
    return ((x + 1) * (n - x + 1));
}
 
// Driver code
public static void main (String[] args)
{
    // Taking the maximum number
    // of cuts allowed as 3
    int n = 3;
     
    // Finding and printing the
    // max number of pieces
    System.out.print("Max number of pieces for n = " +
                   n + " is " + findMaximumPieces(3));
         
}
}
 
// This code is contributed by Kirti_Mangal
Python 3



# Python 3 program to find maximum no of pieces
# by given number of cuts
  
# Function for finding maximum pieces
# with n cuts.
def findMaximumPieces(n):
 
    # to maximize number of pieces
    # x is the horizontal cuts
    x = n // 2
  
    # Now (x) is the horizontal cuts
    # and (n-x) is vertical cuts, then
    # maximum number of pieces = (x+1)*(n-x+1)
    return ((x + 1) * (n - x + 1))
  
# Driver code
if __name__ == "__main__":
  
    #Taking the maximum number of cuts allowed as 3
    n = 3
  
    # Finding and printing the max number of pieces
    print("Max number of pieces for n = " +str( n)
         +" is " + str(findMaximumPieces(3)))
 
# This code is contributed by ChitraNayal
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.
public static int findMaximumPieces(int n)
{
    // to maximize number of pieces
    // x is the horizontal cuts
    int x = n / 2;
 
    // Now (x) is the horizontal 
    // cuts and (n-x) is vertical
    // cuts, then maximum number
    // of pieces = (x+1)*(n-x+1)
    return ((x + 1) * (n - x + 1));
}
 
// Driver code
static public void Main ()
{
    // Taking the maximum number
    // of cuts allowed as 3
    int n = 3;
     
    // Finding and printing the
    // max number of pieces
    Console.Write("Max number of pieces for n = " +
                n + " is " + findMaximumPieces(3));
}
}
 
// This code is contributed by Mahadev
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)
{
    // to maximize number of pieces
    // x is the horizontal cuts
    $x = (int)($n / 2);
 
    // Now (x) is the horizontal cuts
    // and (n-x) is vertical cuts, then
    // maximum number of pieces = (x+1)*(n-x+1)
    return (($x + 1) * ($n - $x + 1));
}
 
// Driver code
 
// Taking the maximum number
// of cuts allowed as 3
$n = 3;
 
// Finding and printing the
// max number of pieces
echo "Max number of pieces for n = " .
    $n . " is " . findMaximumPieces(3);
 
// This code is contributed
// by Akanksha Rai(Abby_akku)
?>
Javascript



<script>
 
// Javascript program to find maximum no of pieces
// by given number of cuts
 
// Function for finding maximum pieces
// with n cuts.
function findMaximumPieces(n)
{
 
    // to maximize number of pieces
    // x is the horizontal cuts
    var x = parseInt(n / 2);
 
    // Now (x) is the horizontal cuts
    // and (n-x) is vertical cuts, then
    // maximum number of pieces = (x+1)*(n-x+1)
    return ((x + 1) * (n - x + 1));
}
 
// Driver code
// Taking the maximum number of cuts allowed as 3
var n = 3;
 
// Finding and printing the max number of pieces
document.write("Max number of pieces for n = " + n
    + " is " + findMaximumPieces(3));
 
// This code is contributed by noob2000.
</script>
Output: 
Max number of pieces for n = 3 is 6
 

My Personal Notes
arrow_drop_up
Next

Pizza cut problem (Or Circle Division by Lines)
Recommended Articles
Page :
Count pieces of circle after N cuts
19, Nov 18
Possible cuts of a number such that maximum parts are divisible by 3
08, Jan 19
Maximum area of a Cake after Horizontal and Vertical cuts
04, Jul 21
Number of ways to cut a stick of length N into in even length at most K units long pieces
18, Jul 20
Minimum number of cuts required to make circle segments equal sized
20, Nov 18
Minimum number of cuts required to pay salary from N length Gold Bar
18, Feb 20
Minimize number of cuts required to break N length stick into N unit length sticks
24, Jun 20
Probability of cutting a rope into three pieces such that the sides form a triangle
29, Aug 18
Probability that the pieces of a broken stick form a n sided polygon
17, Aug 18
Minimum Cuts can be made in the Chessboard such that it is not divided into 2 parts
16, Nov 18
Minimum cuts required to divide the Circle into equal parts
20, Nov 18
Querying maximum number of divisors that a number in a given range has
04, Nov 16
Number with maximum number of prime factors
07, Mar 17
Find maximum number that can be formed using digits of a given number
01, Aug 17
Represent a number as a sum of maximum possible number of Prime Numbers
29, Oct 18
Find the maximum number of composite summands of a number
22, Mar 19
Largest number dividing maximum number of elements in the array
23, Dec 19
Find the largest number smaller than integer N with maximum number of set bits
26, Apr 20
Maximum number of prime factors a number can have with exactly x factors
07, May 20
Minimum and maximum number of digits required to be removed to make a given number divisible by 3
02, Dec 20
Number of ways to form a number with maximum Ks in it
21, Jun 21
Number of sides of Polygon when maximum possible number of diagonals is given
05, Apr 22
Maximum subset sum having difference between its maximum and minimum in range [L, R]
11, Oct 21
Maximum range length such that A[i] is maximum in given range for all i from [1, N]
05, Jul 21
Article Contributed By :
https://media.geeksforgeeks.org/auth/avatar.png
sahilshelangia
@sahilshelangia
Vote for difficulty
Current difficulty :
Medium





Improved By :
Article Tags :
Practice Tags :
Report Issue

We use cookies to ensure you have the best browsing experience on our website. By using our site, you
acknowledge that you have read and understood our
Cookie Policy &
        Privacy Policy

Lightbox

Start Your Coding Journey Now!