Given a right circular cylinder of height , & radius . The task is to find the length of the longest rod that can be inserted within it.
Input : h = 4, r = 1.5 Output : 5 Input : h= 12, r = 2.5 Output : 13
From the figure, it is clear that we can get the length of the rod by using pythagoras theorem, by treating the height of cylinder as perpendicular, diameter as base and length of rod as hypotenuse.
So, l2 = h2 + 4*r2.
l = √(h2 + 4*r2)
Below is the implementation of the above approach:
# Python 3 Program to find the longest
# rod that can be fit within a right
# circular cylinder
# Function to find the side of the cube
def rod(h, r):
# height and radius cannot
# be negative
if (h < 0 and r < 0): return -1 # length of rod l = (math.sqrt(math.pow(h, 2) + 4 * math.pow(r, 2))) return float(l) # Driver code h , r = 4, 1.5 print(rod(h, r)) # This code is contributed # by PrinciRaj1992 [tabby title="C#"]
- Largest right circular cylinder within a cube
- Largest right circular cylinder within a frustum
- Volume of largest right circular cylinder within a Sphere
- Volume of biggest sphere within a right circular cylinder
- Largest right circular cylinder that can be inscribed within a cone
- Largest cube that can be inscribed within a right circular cylinder
- 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
- Smallest Integer to be inserted to have equal sums
- Find the perimeter of a cylinder
- Percentage increase in the cylinder if the height is increased by given percentage but radius remains constant
- Calculate Volume, Curved Surface Area and Total Surface Area Of Cylinder
- Circular primes less than n
- Area of a Circular Sector
- Check whether a number is circular prime or not
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to email@example.com. 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.