

def 					__lowerCamelCase	( UpperCamelCase__   ,							UpperCamelCase__   ,							UpperCamelCase__      ):







							'''simple docstring'''






							def count_of_possible_combinations(UpperCamelCase__      ) -> int:
														if target < 0:
																					return 0
														if target == 0:
																					return 1
														return sum(count_of_possible_combinations(target - item      ) for item in array      )

							return count_of_possible_combinations(UpperCamelCase__      )





def 					__lowerCamelCase	( UpperCamelCase__   ,							UpperCamelCase__   ,							UpperCamelCase__      ):







							'''simple docstring'''






							def count_of_possible_combinations_with_dp_array(
							    UpperCamelCase__   ,							UpperCamelCase__      ) -> int:
														if target < 0:
																					return 0
														if target == 0:
																					return 1
														if dp_array[target] != -1:
																					return dp_array[target]
														snake_case_							=    sum(
														    count_of_possible_combinations_with_dp_array(target - item   ,							UpperCamelCase__      )
														    for item in array      )
														snake_case_							=    answer
														return answer

							snake_case_							=    [-1] * (target + 1)
							return count_of_possible_combinations_with_dp_array(UpperCamelCase__   ,							UpperCamelCase__      )





def 					__lowerCamelCase	( UpperCamelCase__   ,							UpperCamelCase__   ,							UpperCamelCase__      ):







							'''simple docstring'''






							snake_case_							=    [0] * (target + 1)
							snake_case_							=    1

							for i in range(1   ,							target + 1      ):
														for j in range(UpperCamelCase__      ):
																					if i - array[j] >= 0:
																												dp_array[i] += dp_array[i - array[j]]

							return dp_array[target]


if __name__ == "__main__":
					import doctest

					doctest.testmod()
					_UpperCAmelCase		:   Any										=       3
					_UpperCAmelCase		:   int										=       5
					_UpperCAmelCase		:   str										=       [1, 2, 5]
					print(combination_sum_iv(n, array, target))







import numpy as np





def 					__lowerCamelCase	( UpperCamelCase__      ):







							'''simple docstring'''






							return 1 / (1 + np.exp(-vector      ))





def 					__lowerCamelCase	( UpperCamelCase__      ):







							'''simple docstring'''






							return vector * sigmoid(UpperCamelCase__      )


if __name__ == "__main__":
					import doctest

					doctest.testmod()




