def 							lowerCAmelCase(     __lowerCamelCase				,    __lowerCamelCase				,    __lowerCamelCase						):
     __a		 =       len(a__						)
     __a		 =       [[0] * n for i in range(a__						)]
     for i in range(a__						):
          __a		 =       y_points[i]

     for i in range(2				,    a__						):
          for j in range(a__				,    a__						):
               __a		 =       (
                   (xa - x_points[j - i + 1]) * q[j][i - 1]
                   - (xa - x_points[j]) * q[j - 1][i - 1]
               ) / (x_points[j] - x_points[j - i + 1])

     return [q[n - 1][n - 1], q]


if __name__ == "__main__":
 import doctest

 doctest.testmod()





from __future__ import annotations

import numpy as np
def 							lowerCAmelCase(     __lowerCamelCase						):
					return np.maximum(0				,    __lowerCamelCase						)


if __name__ == "__main__":
	print(np.array(relu([-1, 0, 5])))  # --> [0, 0, 5]




