



"""simple docstring"""







import numpy as np



def   a_	(			__a      ):
     A__				=   np.exp(__a      )

     # Add up the all the exponentials
     A__				=   np.sum(__a      )

     # Divide every exponent by the sum of all exponents
     A__				=   exponent_vector / sum_of_exponents

     return softmax_vector


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










"""simple docstring"""







from math import factorial



def   a_	(			__a		,							__a      ):
     return factorial(__a      ) / (factorial(__a      ) * factorial(n - r      ))



def   a_	(			):
     A__				=   0

     for i in range(1		,							101      ):
          for j in range(1		,							i + 1      ):
               if combinations(__a		,							__a      ) > 1e6:
                    total += 1
     return total


if __name__ == "__main__":
 print(solution())



