




from collections.abc import Sequence


def 		lowerCamelCase__       (						_A	,      _A				):







	'''simple docstring'''





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


def 		lowerCamelCase__       (						_A	,      _A				):







	'''simple docstring'''





	snake_case_						       =	0.0
	for coeff in reversed(_A				):
		snake_case_						       =	result * x + coeff
	return result


if __name__ == "__main__":
		lowercase__							:	Any											=		(0.0, 0.0, 5.0, 9.3, 7.0)
		lowercase__							:	Union[str, Any]											=		10.0
		print(evaluate_poly(poly, x))
		print(horner(poly, x))






def 		lowerCamelCase__       (						):







	'''simple docstring'''





	for n in range(1	,      1000000				):
		yield n * (n + 1) // 2


def 		lowerCamelCase__       (						_A				):







	'''simple docstring'''





	snake_case_						       =	1
	snake_case_						       =	2
	while i * i <= n:
		snake_case_						       =	0
		while n % i == 0:
			n //= i
			multiplicity += 1
		divisors_count *= multiplicity + 1
		i += 1
	if n > 1:
		divisors_count *= 2
	return divisors_count


def 		lowerCamelCase__       (						):







	'''simple docstring'''





	return next(i for i in triangle_number_generator() if count_divisors(_A				) > 500				)


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