






'''simple docstring'''





def 	lowerCAmelCase_		(lowercase__						:       str     ,					lowercase__						:       list[str]       )		->    str:


				'''simple docstring'''




				lowerCAmelCase__      			=						''''''
				for word_or_phrase in separated:
								if not isinstance(lowercase__     ,					lowercase__       ):
												raise Exception('''join() accepts only strings to be joined'''       )
								joined += word_or_phrase + separator
				return joined.strip(lowercase__       )


if __name__ == "__main__":
			from doctest import testmod

			testmod()













from math import isclose, sqrt





def 	lowerCAmelCase_		(lowercase__						:       float     ,					lowercase__						:       float     ,					lowercase__						:       float       )		->    tuple[float, float, float]:


				'''simple docstring'''




				lowerCAmelCase__      			=						point_y / 4 / point_x
				lowerCAmelCase__      			=						2 * normal_gradient / (1 + normal_gradient * normal_gradient)
				lowerCAmelCase__      			=						(1 - normal_gradient * normal_gradient) / (
				    1 + normal_gradient * normal_gradient
				)
				lowerCAmelCase__      			=						(sa - ca * incoming_gradient) / (ca + sa * incoming_gradient)

				# to find the next point, solve the simultaeneous equations:
				# y^2 + 4x^2 = 100
				# y - b = m * (x - a)
				# ==> A x^2 + B x + C = 0
				lowerCAmelCase__      			=						outgoing_gradient**2 + 4
				lowerCAmelCase__      			=						2 * outgoing_gradient * (point_y - outgoing_gradient * point_x)
				lowerCAmelCase__      			=						(point_y - outgoing_gradient * point_x) ** 2 - 1_00

				lowerCAmelCase__      			=						(
				    -linear_term - sqrt(linear_term**2 - 4 * quadratic_term * constant_term       )
				) / (2 * quadratic_term)
				lowerCAmelCase__      			=						(
				    -linear_term + sqrt(linear_term**2 - 4 * quadratic_term * constant_term       )
				) / (2 * quadratic_term)

				# two solutions, one of which is our input point
				lowerCAmelCase__      			=						x_minus if isclose(lowercase__     ,					lowercase__       ) else x_plus
				lowerCAmelCase__      			=						point_y + outgoing_gradient * (next_x - point_x)

				return next_x, next_y, outgoing_gradient





def 	lowerCAmelCase_		(lowercase__						:       float = 1.4     ,					lowercase__						:       float = -9.6       )		->    int:


				'''simple docstring'''




				lowerCAmelCase__      			=						0
				lowerCAmelCase__      			=						first_x_coord
				lowerCAmelCase__      			=						first_y_coord
				lowerCAmelCase__      			=						(10.1 - point_y) / (0.0 - point_x)

				while not (-0.01 <= point_x <= 0.01 and point_y > 0):
								lowerCAmelCase__			,		lowerCAmelCase__			,		lowerCAmelCase__      			=						next_point(lowercase__     ,					lowercase__     ,					lowercase__       )
								num_reflections += 1

				return num_reflections


if __name__ == "__main__":
			print(F'''{solution() = }''')





