






def 						__UpperCAmelCase      (					a_							,					a_):
							# "Simpson Rule"
							# int(f) = delta_x/2 * (b-a)/3*(f1 + 4f2 + 2f_3 + ... + fn)
							snake_case_           =							(boundary[1] - boundary[0]) / steps
							snake_case_           =							boundary[0]
							snake_case_           =							boundary[1]
							snake_case_           =							make_points(a_							,					a_							,					a_)
							snake_case_           =							0.0
							y += (h / 3.0) * f(a_)
							snake_case_           =							2
							for i in x_i:
														y += (h / 3) * (4 - 2 * (cnt % 2)) * f(a_)
														cnt += 1
							y += (h / 3.0) * f(a_)
							return y





def 						__UpperCAmelCase      (					a_							,					a_							,					a_):
							snake_case_           =							a + h
							while x < (b - h):
														yield x
														snake_case_           =							x + h





def 						__UpperCAmelCase      (					a_):  # enter your function here
							snake_case_           =							(x - 0) * (x - 0)
							return y





def 						__UpperCAmelCase      (					):
							snake_case_           =							0.0  # Lower bound of integration
							snake_case_           =							1.0  # Upper bound of integration
							snake_case_           =							10.0  # define number of steps or resolution
							snake_case_           =							[a, b]  # define boundary of integration
							snake_case_           =							method_a(a_							,					a_)
							print(f'''y = {y}''')


if __name__ == "__main__":
	main()













def 						__UpperCAmelCase      (					a_):
							return 1 if input_a == 0 else 0





def 						__UpperCAmelCase      (					):
							assert not_gate(0) == 1
							assert not_gate(1) == 0


if __name__ == "__main__":
	print(not_gate(0))
	print(not_gate(1))





