Given the length, breadth, height of a cuboid. The task is to divide the given cuboid in minimum number of cubes such that size of all cubes is same and sum of volumes of cubes is maximum.
Input : l = 2, b = 4, h = 6 Output : 2 6 A cuboid of length 2, breadth 4 and height 6 can be divided into 6 cube of side equal to 2. Volume of cubes = 6*(2*2*2) = 6*8 = 48. Volume of cuboid = 2*4*6 = 48. Input : 1 2 3 Output : 1 6
First of all, we are not allowed to waste volume of cuboid as we meed maximum volume sum. So, each side should be completely divide among all cubes. And since each of three side of cubes are equal, so each side of the cuboid need to be divisible by same number, say x, which will going to be the side of the cube. So, we have to maximize this x, which will divide given length, breadth and height. This x will be maximum only if it is greatest common divisor of given length, breadth and height. So, the length of the cube will be GCD of length, breadth and height.
Now, to compute number of cubes, we know total volume of cuboid and can find volume of one cube (since side is already calculated). So, total number of cubes is equal to (volume of cuboid)/(volume of cube) i.e (l * b * h)/(x * x * x).
Below is implementation of this approach:
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.
- Length of longest rod that can fit into a cuboid
- Find maximum volume of a cuboid from the given perimeter and area
- Maximize volume of cuboid with given sum of sides
- Program for Volume and Surface Area of Cuboid
- Divide 1 to n into two groups with minimum sum difference
- Check if a number can be represented as sum of two consecutive perfect cubes
- Check if a line at 45 degree can divide the plane into two equal weight parts
- Minimum cuts required to divide the Circle into equal parts
- Divide a number into two parts
- Divide array into increasing and decreasing subsequence without changing the order
- Split the given array into K sub-arrays such that maximum sum of all sub arrays is minimum
- Count cubes of size K inscribed in a cube of size N
- Partition into two subarrays of lengths k and (N - k) such that the difference of sums is maximum
- Partition an array such into maximum increasing segments
- Partition a set into two non-empty subsets such that the difference of subset sums is maximum
- Maximum number of region in which N non-parallel lines can divide a plane
- Partition first N natural number into two sets such that their sum is not coprime
- Split N powers of 2 into two subsets such that their difference of sum is minimum
- Maximum sub-array sum after dividing array into sub-arrays based on the given queries
- Split array into minimum number of subsets having maximum pair sum at most K
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.
Improved By : vt_m