





def 			lowerCAmelCase_			(				UpperCamelCase_       ,		UpperCamelCase_       ,		UpperCamelCase_       ,		UpperCamelCase_       ,		UpperCamelCase_	)  ->		None:
       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_			(				UpperCamelCase_       ,		UpperCamelCase_	)  ->		list:
       UpperCamelCase_ 							=	[]  # type: list[int]
       UpperCamelCase_ 							=	[]  # type: list[int]
       backtrack(UpperCamelCase_       ,		UpperCamelCase_       ,		UpperCamelCase_       ,		UpperCamelCase_       ,		0	)
       return answer




def 			lowerCAmelCase_			(				)  ->		None:
       print(combination_sum([-8, 2.3, 0]       ,		1	)	)


if __name__ == "__main__":
     import doctest

     doctest.testmod()
     main()


"""simple docstring"""




from collections.abc import Callable

UpperCAmelCase       :    Optional[int]									=			Callable[[float], float]  # type alias for a real -> real function



def 				__a       (			_lowercase							, _lowercase							, _lowercase							, ):







					"""simple docstring"""





					lowerCamelCase__		:   Tuple  				=					float(_lowercase						)
					while True:
										try:
															lowerCamelCase__		:   str  				=					prev_guess - function(_lowercase						) / derivative(_lowercase						)
										except ZeroDivisionError:
															raise ZeroDivisionError('''Could not find root'''						) from None
										if abs(prev_guess - next_guess						) < 10**-5:
															return next_guess
										lowerCamelCase__		:   List[str]  				=					next_guess



def 				__a       (			_lowercase						):







					"""simple docstring"""





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



def 				__a       (			_lowercase						):







					"""simple docstring"""





					return 3 * (x**2) - 2


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






