

def   _lowerCAmelCase(						__A ,							__A ,							__A ,							__A ,							__A      ):






  if target == 0:
    answer.append(path.copy()      )
  else:
    for index in range(_UpperCAmelCase ,							len(_UpperCAmelCase      )      ):
      if target >= candidates[index]:
        path.append(candidates[index]      )
        backtrack(_UpperCAmelCase ,							_UpperCAmelCase ,							_UpperCAmelCase ,							target - candidates[index] ,							_UpperCAmelCase      )
        path.pop(len(_UpperCAmelCase      ) - 1      )
def   _lowerCAmelCase(						__A ,							__A      ):
  UpperCAmelCase          =	[]  # type: list[int]
  UpperCAmelCase          =	[]  # type: list[int]
  backtrack(_UpperCAmelCase ,							_UpperCAmelCase ,							_UpperCAmelCase ,							_UpperCAmelCase ,							0      )
  return answer
def   _lowerCAmelCase(						):
  print(combination_sum([-8, 2.3, 0] ,							1      )      )


if __name__ == "__main__":
      import doctest

      doctest.testmod()
      main()








from collections.abc import Callable

__magic_name__       =     Callable[[float], float]  # type alias for a real -> real function





def 		__snake_case						(    _UpperCAmelCase       ,			_UpperCAmelCase       ,			_UpperCAmelCase       ,			):
					"""simple docstring"""






					lowercase						   =       float(_UpperCAmelCase				)
					while True:
										try:
															lowercase						   =       prev_guess - function(_UpperCAmelCase				) / derivative(_UpperCAmelCase				)
										except ZeroDivisionError:
															raise ZeroDivisionError('Could not find root'				) from None
										if abs(prev_guess - next_guess				) < 10**-5:
															return next_guess
										lowercase						   =       next_guess





def 		__snake_case						(    _UpperCAmelCase				):
					"""simple docstring"""






					return (x**3) - (2 * x) - 5





def 		__snake_case						(    _UpperCAmelCase				):
					"""simple docstring"""






					return 3 * (x**2) - 2


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






