



'''simple docstring'''

import numpy as np



def   __lowerCamelCase  (   lowerCAmelCase_						)    ->   Union[str, Any]:
		_a  :   Any				 =							np.exp(lowerCAmelCase_						)

		# Add up the all the exponentials
		_a  :   Optional[int]				 =							np.sum(lowerCAmelCase_						)

		# Divide every exponent by the sum of all exponents
		_a  :   List[str]				 =							exponent_vector / sum_of_exponents

		return softmax_vector


if __name__ == "__main__":
							print(softmax((0,)))









'''simple docstring'''

from __future__ import annotations

class 			__magic_name__		:







							def __init__(							self      : List[Any]			,_UpperCAmelCase      : int	):
									_a  :   Tuple				 =							value
									_a  :   Node | None				 =							None
									_a  :   Node | None				 =							None

class 			__magic_name__		:
							lowerCAmelCase :					int







							def __init__(							self      : Union[str, Any]	):
									_a  :   Tuple				 =							0







							def 							__lowercase    (							self      : Tuple			,_UpperCAmelCase      : Node | None			,_UpperCAmelCase      : int	):
									if node is None:
											return

									if path_sum == self.target:
											self.paths += 1

									if node.left:
											self.depth_first_search(node.left			,path_sum + node.left.value	)
									if node.right:
											self.depth_first_search(node.right			,path_sum + node.right.value	)







							def 							__lowercase    (							self      : Union[str, Any]			,_UpperCAmelCase      : Node | None			,_UpperCAmelCase      : int | None = None	):
									if node is None:
											return 0
									if target is not None:
											_a  :   Any				 =							target

									self.depth_first_search(_UpperCAmelCase			,node.value	)
									self.path_sum(node.left	)
									self.path_sum(node.right	)

									return self.paths


if __name__ == "__main__":
							import doctest

							doctest.testmod()




