





'''simple docstring'''




_A:					int							=				"""Tobias Carryer"""

from time import time






class UpperCAmelCase							:



    def __init__(  self     ,			__A     ,			__A     ,			__A     ,			__A=int(time()					)					):  # noqa: B008
     __UpperCAmelCase					=   multiplier
     __UpperCAmelCase					=   increment
     __UpperCAmelCase					=   modulo
     __UpperCAmelCase					=   seed




    def 					__lowerCamelCase						(  self					):
     __UpperCAmelCase					=   (self.multiplier * self.seed + self.increment) % self.modulo
     return self.seed


if __name__ == "__main__":
    # Show the LCG in action.
    _A:					Optional[int]							=				LinearCongruentialGenerator(1_664_525, 1_013_904_223, 2 << 31)
    while True:
        print(lcg.next_number())












'''simple docstring'''




from collections.abc import Sequence







def _lowerCAmelCase     (      _lowerCAmelCase       ,    _lowerCAmelCase    )->     float:
 return sum(c * (x**i) for i, c in enumerate(_lowerCAmelCase    )    )







def _lowerCAmelCase     (      _lowerCAmelCase       ,    _lowerCAmelCase    )->     float:
 __UpperCAmelCase					=   0.0
 for coeff in reversed(_lowerCAmelCase    ):
  __UpperCAmelCase					=   result * x + coeff
 return result


if __name__ == "__main__":
    _A:					str							=				(0.0, 0.0, 5.0, 9.3, 7.0)
    _A:					Dict							=				10.0
    print(evaluate_poly(poly, x))
    print(horner(poly, x))





