






from collections.abc import Callable

import numpy as np


def   lowerCamelCase__			(     lowercase						,     lowercase						,     lowercase						,     lowercase						,     lowercase				):

		"""simple docstring"""






		SCREAMING_SNAKE_CASE       :      Optional[int]							=    int(np.ceil((x_end - xa) / step_size				)				)
		SCREAMING_SNAKE_CASE       :      Union[str, Any]							=    np.zeros((n + 1,)				)
		SCREAMING_SNAKE_CASE       :      Any							=    ya
		SCREAMING_SNAKE_CASE       :      Tuple							=    xa

		for k in range(lowercase				):
				SCREAMING_SNAKE_CASE       :      Tuple							=    y[k] + step_size * ode_func(lowercase						,     y[k]				)
				x += step_size

		return y


if __name__ == "__main__":
			import doctest

			doctest.testmod()














snake_case    				=		"""Tobias Carryer"""

from time import time


class  SCREAMING_SNAKE_CASE			:
     '''simple docstring'''


     def __init__(				self       :	List[Any]					, UpperCAmelCase_       :	List[str]					, UpperCAmelCase_       :	Optional[int]					, UpperCAmelCase_       :	Any					, UpperCAmelCase_       :	int=int(time()      )      ):  # noqa: B008
       SCREAMING_SNAKE_CASE       :      Optional[Any]							=    multiplier
       SCREAMING_SNAKE_CASE       :      Tuple							=    increment
       SCREAMING_SNAKE_CASE       :      int							=    modulo
       SCREAMING_SNAKE_CASE       :      Optional[int]							=    seed






     def 				_A       (				self       :	Tuple      ):
       SCREAMING_SNAKE_CASE       :      Optional[Any]							=    (self.multiplier * self.seed + self.increment) % self.modulo
       return self.seed


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






