





'''simple docstring'''

from graphs.minimum_spanning_tree_kruskal import kruskal

def 						__magic_name__       (							)						->					Tuple:

   '''simple docstring'''







   __SCREAMING_SNAKE_CASE      							=       9
   __SCREAMING_SNAKE_CASE      							=       [
       [0, 1, 4],
       [0, 7, 8],
       [1, 2, 8],
       [7, 8, 7],
       [7, 6, 1],
       [2, 8, 2],
       [8, 6, 6],
       [2, 3, 7],
       [2, 5, 4],
       [6, 5, 2],
       [3, 5, 14],
       [3, 4, 9],
       [5, 4, 10],
       [1, 7, 11],
   ]

   __SCREAMING_SNAKE_CASE      							=       kruskal(__UpperCAmelCase							,	__UpperCAmelCase      )

   __SCREAMING_SNAKE_CASE      							=       [
       [7, 6, 1],
       [2, 8, 2],
       [6, 5, 2],
       [0, 1, 4],
       [2, 5, 4],
       [2, 3, 7],
       [0, 7, 8],
       [3, 4, 9],
   ]

   assert sorted(__UpperCAmelCase      ) == sorted(__UpperCAmelCase      )












'''simple docstring'''

def 						__magic_name__       (							__UpperCAmelCase = 1							,	__UpperCAmelCase = 1000      )						->					int:

   '''simple docstring'''







   __SCREAMING_SNAKE_CASE      							=       1
   __SCREAMING_SNAKE_CASE      							=       0

   for divide_by_number in range(__UpperCAmelCase							,	digit + 1      ):
      __SCREAMING_SNAKE_CASE      							=       []
      __SCREAMING_SNAKE_CASE      							=       numerator
      for _ in range(1							,	digit + 1      ):
         if now_divide in has_been_divided:
            if longest_list_length < len(__UpperCAmelCase      ):
               __SCREAMING_SNAKE_CASE      							=       len(__UpperCAmelCase      )
               __SCREAMING_SNAKE_CASE      							=       divide_by_number
         else:
            has_been_divided.append(__UpperCAmelCase      )
            __SCREAMING_SNAKE_CASE      							=       now_divide * 10 % divide_by_number

   return the_digit


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

    doctest.testmod()





