
"""simple docstring"""


def 					_lowerCamelCase(__UpperCamelCase					,				__UpperCamelCase )       ->				Union[str, Any]:
	if n < 0:
		return 0
	# table[i] represents the number of ways to get to amount i
	_lowerCAmelCase			=[0] * (n + 1)

	# There is exactly 1 way to get to zero(You pick no coins).
	_lowerCAmelCase			=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(__UpperCamelCase					,				n + 1 ):
			table[j] += table[j - coin_val]

	return table[n]


if __name__ == "__main__":
			import doctest

			doctest.testmod()





"""simple docstring"""


def 					_lowerCamelCase(__UpperCamelCase					,				__UpperCamelCase					,				__UpperCamelCase )       ->				float:
	if mass < 0:
		raise ValueError("""The mass of the body cannot be negative""" )
	if radius <= 0:
		raise ValueError("""The radius is always a positive non zero integer""" )
	return (mass * (velocity) ** 2) / radius


if __name__ == "__main__":
			import doctest

			doctest.testmod(verbose=True)



