



'''simple docstring'''







import unittest
from timeit import timeit







def  SCREAMING_SNAKE_CASE__ (				SCREAMING_SNAKE_CASE ,		SCREAMING_SNAKE_CASE     ):
		SCREAMING_SNAKE_CASE_						:Optional[Any]										=      first_num if first_num >= second_num else second_num
		SCREAMING_SNAKE_CASE_						:List[str]										=      max_num
		while (common_mult % first_num > 0) or (common_mult % second_num > 0):
				common_mult += max_num
		return common_mult







def  SCREAMING_SNAKE_CASE__ (				SCREAMING_SNAKE_CASE ,		SCREAMING_SNAKE_CASE     ):
		return b if a == 0 else greatest_common_divisor(b % a ,		SCREAMING_SNAKE_CASE     )







def  SCREAMING_SNAKE_CASE__ (				SCREAMING_SNAKE_CASE ,		SCREAMING_SNAKE_CASE     ):
		return first_num // greatest_common_divisor(SCREAMING_SNAKE_CASE ,		SCREAMING_SNAKE_CASE     ) * second_num







def  SCREAMING_SNAKE_CASE__ (				):
		SCREAMING_SNAKE_CASE_						:str										=      (
		    'from __main__ import least_common_multiple_slow, least_common_multiple_fast'
		)
		print(
		    'least_common_multiple_slow():' ,		timeit('least_common_multiple_slow(1000, 999)' ,		setup=SCREAMING_SNAKE_CASE     ) ,		)
		print(
		    'least_common_multiple_fast():' ,		timeit('least_common_multiple_fast(1000, 999)' ,		setup=SCREAMING_SNAKE_CASE     ) ,		)




class 				__lowerCAmelCase(							unittest.TestCase      ):
			__snake_case  :		List[str]		=      (
			    (1_0, 2_0),
			    (1_3, 1_5),
			    (4, 3_1),
			    (1_0, 4_2),
			    (4_3, 3_4),
			    (5, 1_2),
			    (1_2, 2_5),
			    (1_0, 2_5),
			    (6, 9),
			)
			__snake_case  :		str		=      (2_0, 1_9_5, 1_2_4, 2_1_0, 1_4_6_2, 6_0, 3_0_0, 5_0, 1_8)






			def 				_lowercase	(   self  :							Any	):




					"""simple docstring"""







					for i, (first_num, second_num) in enumerate(self.test_inputs	):
							SCREAMING_SNAKE_CASE_						:Tuple										=      least_common_multiple_slow(SCREAMING_SNAKE_CASE      ,       SCREAMING_SNAKE_CASE	)
							SCREAMING_SNAKE_CASE_						:str										=      least_common_multiple_fast(SCREAMING_SNAKE_CASE      ,       SCREAMING_SNAKE_CASE	)
							with self.subTest(i=SCREAMING_SNAKE_CASE	):
									self.assertEqual(SCREAMING_SNAKE_CASE      ,       self.expected_results[i]	)
									self.assertEqual(SCREAMING_SNAKE_CASE      ,       self.expected_results[i]	)


if __name__ == "__main__":
							benchmark()
							unittest.main()




'''simple docstring'''
from __future__ import annotations







class 					_A						:



   '''simple docstring'''






   def __init__(	self	:					Any					, lowerCamelCase	:					int						)->	None:
          snake_case__					:	Optional[int]          =					value
          snake_case__					:	Node | None          =					None
          snake_case__					:	Node | None          =					None







class 					_A						:



   '''simple docstring'''






   _lowercase    						= 42




   def __init__(	self	:					str						)->	None:
          snake_case__					:	int          =					0




   def   __lowerCAmelCase						(	self	:					Tuple					, lowerCamelCase	:					Node | None					, lowerCamelCase	:					int						)->	None:
          if node is None:
                 return

          if path_sum == self.target:
                 self.paths += 1

          if node.left:
                 self.depth_first_search(node.left					, path_sum + node.left.value						)
          if node.right:
                 self.depth_first_search(node.right					, path_sum + node.right.value						)




   def   __lowerCAmelCase						(	self	:					Tuple					, lowerCamelCase	:					Node | None					, lowerCamelCase	:					int | None = None						)->	int:
          if node is None:
                 return 0
          if target is not None:
                 snake_case__					:	Dict          =					target

          self.depth_first_search(lowerCamelCase					, node.value						)
          self.path_sum(node.left						)
          self.path_sum(node.right						)

          return self.paths


if __name__ == "__main__":
     import doctest

     doctest.testmod()




