





'''simple docstring'''






def        UpperCamelCase__		(						__magic_name__  :   int = 1		,       __magic_name__  :   int = 10_00      )				->			int:
 '''simple docstring'''






 snake_case__     :					Optional[int]    =  1
 snake_case__     :					int    =  0

 for divide_by_number in range(_lowerCAmelCase		,       digit + 1      ):
  snake_case__     :					list[int]    =  []
  snake_case__     :					Union[str, Any]    =  numerator
  for _ in range(1		,       digit + 1      ):
   if now_divide in has_been_divided:
    if longest_list_length < len(_lowerCAmelCase      ):
     snake_case__     :					Optional[Any]    =  len(_lowerCAmelCase      )
     snake_case__     :					Union[str, Any]    =  divide_by_number
   else:
    has_been_divided.append(_lowerCAmelCase      )
    snake_case__     :					Dict    =  now_divide * 10 % divide_by_number

 return the_digit


# Tests
if __name__ == "__main__":
    import doctest

    doctest.testmod()











from __future__ import annotations

from cmath import sqrt

def   __snake_case    (       _lowerCAmelCase			:			int					,					_lowerCAmelCase			:			int					,					_lowerCAmelCase			:			int						)			->    tuple[complex, complex]:

   if a == 0:
      raise ValueError("Coefficient 'a' must not be zero."						)
   A_       :					Tuple        =      b * b - 4 * a * c

   A_       :					Any        =      (-b + sqrt(_lowerCAmelCase						)) / (2 * a)
   A_       :					Union[str, Any]        =      (-b - sqrt(_lowerCAmelCase						)) / (2 * a)

   return (
       root_a.real if not root_a.imag else root_a,
       root_a.real if not root_a.imag else root_a,
   )

def   __snake_case    (       )			->    List[Any]:
   A_   ,    A_       :					Optional[Any]        =      quadratic_roots(a=5					,					b=6					,					c=1						)
   print(f"The solutions are: {solutiona} and {solutiona}"						)


if __name__ == "__main__":
 main()
