




def 							__SCREAMING_SNAKE_CASE						(    snake_case_			,					snake_case_		):

						'''simple docstring'''


						if n < 0:
												return 0
						# table[i] represents the number of ways to get to amount i
						_UpperCAmelCase									=  [0] * (n + 1)

						# There is exactly 1 way to get to zero(You pick no coins).
						_UpperCAmelCase									=  1

						# Pick all coins one by one and update table[] values
						# after the index greater than or equal to the value of the
						# picked coin
						for coin_val in s:
												for j in range(snake_case_			,					n + 1		):
																		table[j] += table[j - coin_val]

						return table[n]


if __name__ == "__main__":
				import doctest

				doctest.testmod()








from math import exp


def 							__SCREAMING_SNAKE_CASE						(    snake_case_		):

						'''simple docstring'''


						return 8 * x - 2 * exp(-x		)


def 							__SCREAMING_SNAKE_CASE						(    snake_case_			,					snake_case_			,					snake_case_		):

						'''simple docstring'''


						_UpperCAmelCase									=  lower_bound
						_UpperCAmelCase									=  upper_bound
						for _ in range(0			,					snake_case_		):
												_UpperCAmelCase							,				_UpperCAmelCase									=  xa, xa - (f(snake_case_		) * (xa - xa)) / (f(snake_case_		) - f(snake_case_		))
						return xa


if __name__ == "__main__":
				print(f"""Example: {secant_method(1, 3, 2)}""")




