






'''simple docstring'''







def 						A__			(				__lowerCAmelCase		:			float						):
						return 10 - x * x
def 						A__			(				__lowerCAmelCase		:			float   ,    __lowerCAmelCase		:			float						):
						# Bolzano theory in order to find if there is a root between a and b
						if equation(__lowerCAmelCase						) * equation(__lowerCAmelCase						) >= 0:
												raise ValueError("""Wrong space!"""						)

						lowerCamelCase__         =  a
						while (b - a) >= 0.01:
												# Find middle point
												lowerCamelCase__         =  (a + b) / 2
												# Check if middle point is root
												if equation(__lowerCAmelCase						) == 0.0:
																		break
												# Decide the side to repeat the steps
												if equation(__lowerCAmelCase						) * equation(__lowerCAmelCase						) < 0:
																		lowerCamelCase__         =  c
												else:
																		lowerCamelCase__         =  c
						return c


if __name__ == "__main__":
							import doctest

							doctest.testmod()

							print(bisection(-2, 5))
							print(bisection(0, 6))









'''simple docstring'''







def 						A__			(				):
						return [
						    a * b * (1000 - a - b)
						    for a in range(1   ,    999						)
						    for b in range(__lowerCAmelCase   ,    999						)
						    if (a * a + b * b == (1000 - a - b) ** 2)
						][0]


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

