


from __future__ import annotations







def 						_lowercase       (     __lowerCamelCase			:					int		,__lowerCamelCase			:					int		,__lowerCamelCase			:					int			)  ->   tuple[float, float]:





     '''simple docstring'''





     assert (
         c % greatest_common_divisor(__lowerCamelCase		,__lowerCamelCase			) == 0
     )  # greatest_common_divisor(a,b) function implemented below
     (UpperCamelCase__)							:  Union[str, Any]								=     extended_gcd(__lowerCamelCase		,__lowerCamelCase			)  # extended_gcd(a,b) function implemented below
     UpperCamelCase__							:  List[Any]								=     c / d
     return (r * x, r * y)







def 						_lowercase       (     __lowerCamelCase			:					int		,__lowerCamelCase			:					int		,__lowerCamelCase			:					int		,__lowerCamelCase			:					int = 2			)  ->   None:





     '''simple docstring'''





     (UpperCamelCase__)							:  int								=     diophantine(__lowerCamelCase		,__lowerCamelCase		,__lowerCamelCase			)  # Initial value
     UpperCamelCase__							:  List[Any]								=     greatest_common_divisor(__lowerCamelCase		,__lowerCamelCase			)
     UpperCamelCase__							:  str								=     a // d
     UpperCamelCase__							:  Any								=     b // d

     for i in range(__lowerCamelCase			):
          UpperCamelCase__							:  int								=     xa + i * q
          UpperCamelCase__							:  Optional[int]								=     ya - i * p
          print(__lowerCamelCase		,__lowerCamelCase			)







def 						_lowercase       (     __lowerCamelCase			:					int		,__lowerCamelCase			:					int			)  ->   int:





     '''simple docstring'''





     if a < b:
          UpperCamelCase__							:  Tuple								=     b, a

     while a % b != 0:
          UpperCamelCase__							:  Union[str, Any]								=     b, a % b

     return b







def 						_lowercase       (     __lowerCamelCase			:					int		,__lowerCamelCase			:					int			)  ->   tuple[int, int, int]:





     '''simple docstring'''





     assert a >= 0 and b >= 0

     if b == 0:
          UpperCamelCase__							:  List[str]								=     a, 1, 0
     else:
          (UpperCamelCase__)							:  int								=     extended_gcd(__lowerCamelCase		,a % b			)
          UpperCamelCase__							:  Any								=     q
          UpperCamelCase__							:  str								=     p - q * (a // b)

     assert a % d == 0 and b % d == 0
     assert d == a * x + b * y

     return (d, x, y)


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

  testmod(name="""diophantine""", verbose=True)
  testmod(name="""diophantine_all_soln""", verbose=True)
  testmod(name="""extended_gcd""", verbose=True)
  testmod(name="""greatest_common_divisor""", verbose=True)








import warnings

from ...utils import logging
from .image_processing_mobilenet_va import MobileNetVaImageProcessor


_SCREAMING_SNAKE_CASE :					List[str]			=	logging.get_logger(__name__)

class  UpperCamelCase__ ( __lowerCamelCase			):






      def __init__(     self					:   List[str],		*__lowerCamelCase					:   Optional[int],		**__lowerCamelCase					:   Dict   )  -> None:
           warnings.warn(
               '''The class MobileNetV1FeatureExtractor is deprecated and will be removed in version 5 of Transformers.'''
               ''' Please use MobileNetV1ImageProcessor instead.''',		__lowerCamelCase,		)
           super().__init__(*__lowerCamelCase,		**__lowerCamelCase   )




