形成空心矩形棱镜所需的最小块数

给定块L、B和H的尺寸，任务是形成一个长度为A和高度为Ht的空心矩形棱柱，使得需要最少的块数。
例子：

Input: L = 40, B = 30, H = 10 & A = 500, Ht = 300 
Output: 500
Input: L = 30, B = 20, H = 20, & A = 600, Ht =240 
Output: 960 
 

方法：
计算每层所需的最小块数，通过找到矩形棱柱的 4 个边所需的块数，以占据最大长度的方式设置块，然后选择块边可以作为块的高度。从宽度或高度中取较大者作为高度。
下面是上述方法的实现：

C++

// C++ Implementation to find the minimum
// no of blocks required to form
// hollow rectangular prism
#include 
using namespace std;
 
// Function to display output
void disp(int row_no, int block)
{
    cout << row_no * block;
}
 
// Function to return minimum no of layers
// required to form the hollow prism
int row(int ht, int h)
{
    return ht / h;
}
 
// Function to calculate no of blocks
// required for each layer
void calculate(int l, int w, int h, int a, int ht)
{
    // No of blocks required for each row
    int no_block = (4 * a) / l;
    int row_no;
 
    // Check for no of layers is minimum
    if (h < w)
        row_no = row(ht, w);
    else
        row_no = row(ht, h);
    disp(row_no, no_block);
}
 
// Driver function
int main()
{
    // Length, width, height of each block
    int l = 50, w = 20, h = 35;
 
    // Side of one wall
    int a = 700;
 
    // height of each wall
    int ht = 140;
 
    calculate(l, w, h, a, ht);
    return 0;
}

Java

// Java Implementation to find the minimum
// no of blocks required to form
// hollow rectangular prism
import java.util.*;
 
class GFG{
  
// Function to display output
static void disp(int row_no, int block)
{
    System.out.print(row_no * block);
}
  
// Function to return minimum no of layers
// required to form the hollow prism
static int row(int ht, int h)
{
    return ht / h;
}
  
// Function to calculate no of blocks
// required for each layer
static void calculate(int l, int w, int h, int a, int ht)
{
    // No of blocks required for each row
    int no_block = (4 * a) / l;
    int row_no;
  
    // Check for no of layers is minimum
    if (h < w)
        row_no = row(ht, w);
    else
        row_no = row(ht, h);
    disp(row_no, no_block);
}
  
// Driver function
public static void main(String[] args)
{
    // Length, width, height of each block
    int l = 50, w = 20, h = 35;
  
    // Side of one wall
    int a = 700;
  
    // height of each wall
    int ht = 140;
  
    calculate(l, w, h, a, ht);
}
}
 
// This code is contributed by PrinciRaj1992

Python 3

# Python 3 Implementation to find the minimum
# no of blocks required to form
# hollow rectangular prism
 
# Function to display output
def disp(row_no,block):
    print(row_no * block)
 
# Function to return minimum no of layers
# required to form the hollow prism
def row(ht, h):
    return ht // h
 
# Function to calculate no of blocks
# required for each layer
def calculate(l, w, h, a, ht):
     
        # No of blocks required for each row
    no_block = (4 * a) // l
     
    # Check for no of layers is minimum
    if (h < w):
        row_no = row(ht, w)
    else:
        row_no = row(ht, h)
    disp(row_no, no_block)
 
# Driver function
if __name__ == '__main__':
    # Length, width, height of each block
    l = 50
    w = 20
    h = 35
 
    # Side of one wall
    a = 700
 
    # height of each wall
    ht = 140
 
    calculate(l, w, h, a, ht)
 
# This code is contributed by Surendra_Gangwar

C#

// C# Implementation to find the minimum
// no of blocks required to form
// hollow rectangular prism
using System;
 
class GFG{
 
// Function to display output
static void disp(int row_no, int block)
{
    Console.Write(row_no * block);
}
 
// Function to return minimum no of layers
// required to form the hollow prism
static int row(int ht, int h)
{
    return ht / h;
}
 
// Function to calculate no of blocks
// required for each layer
static void calculate(int l, int w, int h,
                        int a, int ht)
{
    // No of blocks required for each row
    int no_block = (4 * a) / l;
    int row_no;
 
    // Check for no of layers is minimum
    if (h < w)
        row_no = row(ht, w);
    else
        row_no = row(ht, h);
    disp(row_no, no_block);
}
 
// Driver function
public static void Main(String[] args)
{
    // Length, width, height of each block
    int l = 50, w = 20, h = 35;
 
    // Side of one wall
    int a = 700;
 
    // height of each wall
    int ht = 140;
 
    calculate(l, w, h, a, ht);
}
}
 
// This code is contributed by PrinciRaj1992

Javascript

// javascript Implementation to find the minimum
// no of blocks required to form
// hollow rectangular prism
 
// Function to display output
function disp( row_no,  block)
{
     document.write( row_no * block);
}
 
// Function to return minimum no of layers
// required to form the hollow prism
function row( ht,  h)
{
    return ht / h;
}
 
// Function to calculate no of blocks
// required for each layer
function calculate( l,  w,  h,  a,  ht)
{
 
    // No of blocks required for each row
    let no_block = (4 * a) / l;
    let row_no;
 
    // Check for no of layers is minimum
    if (h < w)
        row_no = row(ht, w);
    else
        row_no = row(ht, h);
    disp(row_no, no_block);
}
 
// Driver function
 
    // Length, width, height of each block
    let l = 50, w = 20, h = 35;
 
    // Side of one wall
    let a = 700;
 
    // height of each wall
    let ht = 140;
    calculate(l, w, h, a, ht);
        
// This code is contributed by Rajput-Ji
 

输出：

224