Given a perimeter P, the task is to find the number of right triangles possible with perimeter equal to p.

Examples:

Input: P = 12 Output: number of right triangles = 1 The only right angle possible is with sides hypotenuse = 5, perpendicular = 4 and base = 3. Input: p = 840 Output: number of right triangles = 8

So the aim is to find the number of solutions which satisfy equations a + b + c = p and a^{2} + b^{2} = c^{2}.

A **naive** approach is to run two loops for a(1 to p/2) and b(a+1 to p/3) then make c=p-a-b and increase count by one if . This will take time.

An **efficient** approach can be found by little algebraic manipulation :

Since a + c > b or, p – b > b or, b < p/2. Thus iterating b from 1 to p/2, calculating a and storing only the whole number a would give all solutions for a given p. There are no right triangles are possible for odd p as right angle triangles follow the Pythagoras theorem. Use a list of pairs to store the values of a and band return the count at the end.

Below is the implementation of the above approach.

`# python program to find the number of ` `# right triangles with given perimeter ` ` ` `# Function to return the count ` `def` `countTriangles(p): ` ` ` ` ` `# making a list to store (a, b) pairs ` ` ` `store ` `=` `[] ` ` ` ` ` `# no triangle if p is odd ` ` ` `if` `p ` `%` `2` `!` `=` `0` `: ` `return` `0` ` ` `else` `: ` ` ` `count ` `=` `0` ` ` `for` `b ` `in` `range` `(` `1` `, p ` `/` `/` `2` `): ` ` ` ` ` `a ` `=` `p ` `/` `2` `*` `((p ` `-` `2` `*` `b) ` `/` `(p ` `-` `b)) ` ` ` `inta ` `=` `int` `(a) ` ` ` `if` `(a ` `=` `=` `inta ): ` ` ` ` ` `# make (a, b) pair in sorted order ` ` ` `ab ` `=` `tuple` `(` `sorted` `((inta, b))) ` ` ` ` ` `# check to avoid duplicates ` ` ` `if` `ab ` `not` `in` `store : ` ` ` `count ` `+` `=` `1` ` ` `# store the new pair ` ` ` `store.append(ab) ` ` ` `return` `count ` ` ` `# Driver Code ` `p ` `=` `840` `print` `(` `"number of right triangles = "` `+` `str` `(countTriangles(p))) ` |

*chevron_right*

*filter_none*

**Output:**

number of right triangles = 8

**Time complexity:** O(P)

## Recommended Posts:

- Count number of triangles possible for the given sides range
- Count of Equilateral Triangles of unit length possible from a given Hexagon
- Count the number of possible triangles
- Count number of triangles possible with length of sides not exceeding N
- Number of triangles possible with given lengths of sticks which are powers of 2
- Maximum area of rectangle possible with given perimeter
- Number of possible Triangles in a Cartesian coordinate system
- Number of possible permutations when absolute difference between number of elements to the right and left are given
- Maximum count of Equilateral Triangles that can be formed within given Equilateral Triangle
- Count the total number of triangles after Nth operation
- Count number of Unique Triangles using Operator overloading
- Number of triangles that can be formed with given N points
- Python - Find the maximum number of triangles with given points on three lines
- Program to calculate area and perimeter of a rhombus whose diagonals are given
- Find maximum volume of a cuboid from the given perimeter and area
- Perimeter of Convex hull for a given set of points
- Count all possible paths from top left to bottom right of a mXn matrix
- Count all possible paths from top left to bottom right of a Matrix without crossing the diagonal
- Count triangles required to form a House of Cards of height N
- Number of possible pairs of Hypotenuse and Area to form right angled 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.