




from collections.abc import Sequence







def 			lowerCamelCase_		(       UpperCamelCase__				:      Union[str, Any] ,     UpperCamelCase__				:      Any      )     ->       float:





				"""simple docstring"""


				return sum(c * (x**i) for i, c in enumerate(_SCREAMING_SNAKE_CASE      )      )







def 			lowerCamelCase_		(       UpperCamelCase__				:      str ,     UpperCamelCase__				:      Dict      )     ->       float:





				"""simple docstring"""


				__lowerCamelCase		       =    0.0
				for coeff in reversed(_SCREAMING_SNAKE_CASE      ):
								__lowerCamelCase		       =    result * x + coeff
				return result


if __name__ == "__main__":
					__A        =    (0.0, 0.0, 5.0, 9.3, 7.0)
					__A        =    1_0.0
					print(evaluate_poly(poly, x))
					print(horner(poly, x))








def      A      (      _SCREAMING_SNAKE_CASE ,_SCREAMING_SNAKE_CASE    )	-> Any:
       # "extended trapezoidal rule"
       # int(f) = dx/2 * (f1 + 2f2 + ... + fn)
       lowerCamelCase   :      str			 =					(boundary[1] - boundary[0]) / steps
       lowerCamelCase   :      List[str]			 =					boundary[0]
       lowerCamelCase   :      Union[str, Any]			 =					boundary[1]
       lowerCamelCase   :      int			 =					make_points(_SCREAMING_SNAKE_CASE ,_SCREAMING_SNAKE_CASE ,_SCREAMING_SNAKE_CASE    )
       lowerCamelCase   :      List[str]			 =					0.0
       y += (h / 2.0) * f(_SCREAMING_SNAKE_CASE    )
       for i in x_i:
              # print(i)
              y += h * f(_SCREAMING_SNAKE_CASE    )
       y += (h / 2.0) * f(_SCREAMING_SNAKE_CASE    )
       return y

def      A      (      _SCREAMING_SNAKE_CASE ,_SCREAMING_SNAKE_CASE ,_SCREAMING_SNAKE_CASE    )	-> int:
       lowerCamelCase   :      int			 =					a + h
       while x < (b - h):
              yield x
              lowerCamelCase   :      List[str]			 =					x + h

def      A      (      _SCREAMING_SNAKE_CASE    )	-> Optional[Any]:  # enter your function here
       lowerCamelCase   :      str			 =					(x - 0) * (x - 0)
       return y

def      A      (      )	-> int:
       lowerCamelCase   :      int			 =					0.0  # Lower bound of integration
       lowerCamelCase   :      int			 =					1.0  # Upper bound of integration
       lowerCamelCase   :      Dict			 =					10.0  # define number of steps or resolution
       lowerCamelCase   :      int			 =					[a, b]  # define boundary of integration
       lowerCamelCase   :      str			 =					method_a(_SCREAMING_SNAKE_CASE ,_SCREAMING_SNAKE_CASE    )
       print(f'''y = {y}'''    )


if __name__ == "__main__":
       main()






