






"""simple docstring"""





import math







class 						_a  :





   '''simple docstring'''






   def __init__(       self					, UpperCAmelCase_					, UpperCAmelCase_					, UpperCAmelCase_)			->   int:




          '''simple docstring'''




          lowercase__:							str         =     x
          lowercase__:							Dict         =     y
          lowercase__:							Optional[Any]         =     z





   def __repr__(       self)			->   str:




          '''simple docstring'''




          return F"""Point({self.x}, {self.y}, {self.z})"""







def 							A(    snake_case_		,  snake_case_						):
       """simple docstring"""





       return math.sqrt(abs((b.x - a.x) ** 2 + (b.y - a.y) ** 2 + (b.z - a.z) ** 2						)						)


if __name__ == "__main__":
  import doctest

  doctest.testmod()












'''simple docstring'''







def 		snake_case_				(_a      :				Any       ,  _a      :				Union[str, Any]	):
    if n < 0:
        return 0
    # table[i] represents the number of ways to get to amount i
    UpperCAmelCase     			=						[0] * (n + 1)

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

    return table[n]


if __name__ == "__main__":
   import doctest

   doctest.testmod()




