Largest cube that can be inscribed within a right circular cylinder
Given here is a right circular cylinder of height h and radius r. The task is to find the volume of biggest cube that can be inscribed within it.
Examples:
Input: h = 3, r = 2 Output: volume = 27 Input: h = 5, r = 4 Output: volume = 125
Approach: From the figure, it can be clearly understand that side of the cube = height of the cylinder.
So, the volume = (height)^3
Below is the implementation of the above approach:
C++
// C++ Program to find the biggest cube // inscribed within a right circular cylinder #include <bits/stdc++.h> using namespace std; // Function to find the volume of the cube float cube( float h, float r) { // height and radius cannot be negative if (h < 0 && r < 0) return -1; // volume of the cube float a = pow (h, 3); return a; } // Driver code int main() { float h = 5, r = 4; cout << cube(h, r) << endl; return 0; } |
chevron_right
filter_none
Java
// Java Program to find the biggest cube // inscribed within a right circular cylinder class Solution { // Function to find the volume of the cube static float cube( float h, float r) { // height and radius cannot be negative if (h < 0 && r < 0 ) return - 1 ; // volume of the cube float a = ( float )Math.pow(h, 3 ); return a; } // Driver code public static void main(String args[]) { float h = 5 , r = 4 ; System.out.println( cube(h, r) ); } } //contributed by Arnab Kundu |
chevron_right
filter_none
Python 3
# Python 3 Program to find the biggest cube # inscribed within a right circular cylinder import math # Function to find the volume of the cube def cube(h, r): # height and radius cannot be negative if (h < 0 and r < 0 ): return - 1 # volume of the cube a = math. pow (h, 3 ) return a # Driver code h = 5 ; r = 4 ; print (cube(h, r)); # This code is contributed # by Akanksha Rai |
chevron_right
filter_none
C#
// C# Program to find the biggest // cube inscribed within a right // circular cylinder using System; class GFG { // Function to find the volume // of the cube static float cube( float h, float r) { // height and radius cannot // be negative if (h < 0 && r < 0) return -1; // volume of the cube float a = ( float )Math.Pow(h, 3); return a; } // Driver code public static void Main() { float h = 5, r = 4; Console.Write( cube(h, r) ); } } // This code is contributed // by 29AjayKumar |
chevron_right
filter_none
PHP
<?php // PHP Program to find the biggest // cube inscribed within a right // circular cylinder // Function to find the volume // of the cube function cube( $h , $r ) { // height and radius cannot // be negative if ( $h < 0 && $r < 0) return -1; // volume of the cube $a = pow( $h , 3); return $a ; } // Driver code $h = 5; $r = 4; echo cube( $h , $r ); // This code is contributed by @Tushil. ?> |
chevron_right
filter_none
Output:
125
Recommended Posts:
- Largest right circular cylinder that can be inscribed within a cone which is in turn inscribed within a cube
- Largest sphere that can be inscribed in a right circular cylinder inscribed in a frustum
- Largest right circular cylinder within a cube
- Largest sphere that can be inscribed within a cube which is in turn inscribed within a right circular cone
- Largest right circular cone that can be inscribed within a sphere which is inscribed within a cube
- Largest right circular cylinder that can be inscribed within a cone
- Largest cube that can be inscribed within a right circular cone
- Largest right circular cylinder within a frustum
- Largest cube that can be inscribed within the sphere
- Largest cone that can be inscribed within a cube
- Volume of largest right circular cylinder within a Sphere
- Largest sphere that can be inscribed inside a cube
- Largest right circular cone that can be inscribed within a sphere
- Largest ellipse that can be inscribed within a rectangle which in turn is inscribed within a semicircle
- Largest square that can be inscribed within a hexagon which is inscribed within an equilateral triangle
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 Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.