


"""simple docstring"""
def 						lowercase				(	)	->int:
	"""simple docstring"""





	for a in range(300	):
		for b in range(a + 1	,  400	):
			for c in range(b + 1	,  500	):
				if (a + b + c) == 1_000 and (a**2) + (b**2) == (c**2):
					return a * b * c

	return -1






def 						lowercase				(	)	->int:
	"""simple docstring"""





	for a in range(300	):
		for b in range(400	):
			__snake_case      :		Tuple         =							1_000 - a - b
			if a < b < c and (a**2) + (b**2) == (c**2):
				return a * b * c

	return -1






def 						lowercase				(	)	->None:
	"""simple docstring"""





	import timeit

	print(
	    timeit.timeit('''solution()'''	,  setup='''from __main__ import solution'''	,  number=1_000	)	)
	print(
	    timeit.timeit(
	        '''solution_fast()'''	,  setup='''from __main__ import solution_fast'''	,  number=1_000	)	)


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






from collections.abc import Callable

_SCREAMING_SNAKE_CASE     =     Callable[[float], float]  # type alias for a real -> real function
def 					__lowercase						(    lowerCamelCase__			,					lowerCamelCase__			,					lowerCamelCase__			,					)					->float:

  '''simple docstring'''




  a__  		=  float(lowerCamelCase__       )
  while True:
    try:
      a__  		=  prev_guess - function(lowerCamelCase__       ) / derivative(lowerCamelCase__       )
    except ZeroDivisionError:
      raise ZeroDivisionError("Could not find root"       ) from None
    if abs(prev_guess - next_guess       ) < 10**-5:
      return next_guess
    a__  		=  next_guess
def 					__lowercase						(    lowerCamelCase__       )					->float:

  '''simple docstring'''




  return (x**3) - (2 * x) - 5
def 					__lowercase						(    lowerCamelCase__       )					->float:

  '''simple docstring'''




  return 3 * (x**2) - 2


if __name__ == "__main__":
     print(newton(f, fa, 3))

