human
What is a code to split given isosceles triangle of height H into N equal parts and the other steps required given the following:
Split given isosceles triangle of height H into N equal parts | Function to divide the isosceles triangle in equal parts by making N - 1 cuts parallel to the base.
Iterate over the range [ 1 , n - 1 ].
Driver Code.
Given N.
Given H.
Function call"
How can the above be solved in Python?
assistant
#Here is code to split given isosceles triangle of height H into N equal parts and the other steps required.
 def findPoint ( n , h ) :
	for i in range ( 1 , n ) :
		print ( " { 0 : . 2f } " . format ( ( ( i / n ) ** 0.5 ) * h ) , end = ' ▁ ' )
if __name__ == ' _ _ main _ _ ' :
	n = 3
	h = 2
	findPoint ( n , h )