
"""simple docstring"""




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

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

					return table[n]


if __name__ == "__main__":
	import doctest

	doctest.testmod()


'''simple docstring'''





from ...utils import (
    OptionalDependencyNotAvailable,
    is_torch_available,
    is_transformers_available,
    is_transformers_version,
)


try:
 if not (is_transformers_available() and is_torch_available() and is_transformers_version(">=", "4.27.0")):
  raise OptionalDependencyNotAvailable()
except OptionalDependencyNotAvailable:
 from ...utils.dummy_torch_and_transformers_objects import (
     AudioLDMPipeline,
 )
else:
 from .pipeline_audioldm import AudioLDMPipeline






