Given that the area of a right-angled triangle is X times its base b. The task is to find the height of the given triangle.
Examples:
Input: X = 40
Output: 80
Input: X = 100
Output: 200
Approach: We know that the area of a right-angled triangle, Area = (base * height) / 2 and it is given that this area is X times the base i.e. base * X = (base * height) / 2.
Solving for height, we get height = (2 * base * X) / base = 2 * X.
Below is the implementation of the above approach:
C++
// C++ implementation of the approach#include <bits/stdc++.h>using namespace std;// Function to return the height of the// right-angled triangle whose area// is X times its baseint getHeight(int X){ return (2 * X);}// Driver codeint main(){ int X = 35; cout << getHeight(X); return 0;} |
Java
// Java implementation of the approachimport java.util.*;import java.lang.*;import java.io.*;class Gfg{ // Function to return the height of the// right-angled triangle whose area// is X times its basestatic int getHeight(int X){ return (2 * X);}// Driver codepublic static void main (String[] args) throws java.lang.Exception{ int X = 35; System.out.println(getHeight(X)) ;}}// This code is contributed by nidhiva |
Python3
# Python 3 implementation of the approach# Function to return the height of the# right-angled triangle whose area# is X times its basedef getHeight(X): return (2 * X)# Driver codeif __name__ == '__main__': X = 35 print(getHeight(X))# This code is contributed by# Surendra_Gangwar |
C#
// C# implementation of the approachusing System;class Gfg{ // Function to return the height of the// right-angled triangle whose area// is X times its basestatic int getHeight(int X){ return (2 * X);}// Driver codepublic static void Main () { int X = 35; Console.WriteLine(getHeight(X)) ;}}// This code is contributed by anuj_67.. |
Javascript
<script> // Function to return the height of the// right-angled triangle whose area// is X times its basefunction getHeight(X){ return (2 * X);}// Driver codevar X = 35;document.write(getHeight(X)) ;// This code is contributed by Amit Katiyar</script> |
Output:
70
Time Complexity: O(1), as we are doing only arithmetic operation.
Auxiliary Space: O(1), as we are not using any extra space.
Feeling lost in the world of random DSA topics, wasting time without progress? It’s time for a change! Join our DSA course, where we’ll guide you on an exciting journey to master DSA efficiently and on schedule.
Ready to dive in? Explore our Free Demo Content and join our DSA course, trusted by over 100,000 neveropen!
Ready to dive in? Explore our Free Demo Content and join our DSA course, trusted by over 100,000 neveropen!
