




import numpy as np
from numpy import floataa
from numpy.typing import NDArray




def        __SCREAMING_SNAKE_CASE (	lowercase_       ,  lowercase_   )							->						NDArray[floataa]:

    """simple docstring"""


    __UpperCamelCase		,   __UpperCamelCase			=    np.shape(lowercase_   )

    __UpperCamelCase			=    np.zeros((rows, 1)       ,  dtype=lowercase_   )
    for row in reversed(range(lowercase_   )   ):
        __UpperCamelCase			=    0
        for col in range(row + 1       ,  lowercase_   ):
            total += coefficients[row, col] * x[col]

        __UpperCamelCase			=    (vector[row] - total) / coefficients[row, row]

    return x




def        __SCREAMING_SNAKE_CASE (	lowercase_       ,  lowercase_   )							->						NDArray[floataa]:

    """simple docstring"""


    __UpperCamelCase		,   __UpperCamelCase			=    np.shape(lowercase_   )
    if rows != columns:
        return np.array(()       ,  dtype=lowercase_   )

    # augmented matrix
    __UpperCamelCase			=    np.concatenate((coefficients, vector)       ,  axis=1   )
    __UpperCamelCase			=    augmented_mat.astype('''float64'''   )

    # scale the matrix leaving it triangular
    for row in range(rows - 1   ):
        __UpperCamelCase			=    augmented_mat[row, row]
        for col in range(row + 1       ,  lowercase_   ):
            __UpperCamelCase			=    augmented_mat[col, row] / pivot
            augmented_mat[col, :] -= factor * augmented_mat[row, :]

    __UpperCamelCase			=    retroactive_resolution(
        augmented_mat[:, 0:columns]       ,  augmented_mat[:, columns : columns + 1]   )

    return x


if __name__ == "__main__":
 import doctest

 doctest.testmod()









import functools
from math import sqrt
from time import time



def  snake_case_(_UpperCamelCase					,			*_UpperCamelCase					,			**_UpperCamelCase	)				->      str:



  """simple docstring"""






  _snake_case		=				time()
  _snake_case		=				func(*_UpperCamelCase					,			**_UpperCamelCase	)
  _snake_case		=				time()
  if int(end - start	) > 0:
    print(F"""{func.__name__} runtime: {(end - start):0.4f} s"""	)
  else:
    print(F"""{func.__name__} runtime: {(end - start) * 1_000:0.4f} ms"""	)
  return output



def  snake_case_(_UpperCamelCase	)				->      list[int]:



  """simple docstring"""






  if n < 0:
    raise Exception('''n is negative'''	)
  if n == 0:
    return [0]
  _snake_case		=				[0, 1]
  for _ in range(n - 1	):
    fib.append(fib[-1] + fib[-2]	)
  return fib



def  snake_case_(_UpperCamelCase	)				->      list[int]:



  """simple docstring"""






  def fib_recursive_term(_UpperCamelCase	) -> int:
    if i < 0:
      raise Exception('''n is negative'''	)
    if i < 2:
      return i
    return fib_recursive_term(i - 1	) + fib_recursive_term(i - 2	)

  if n < 0:
    raise Exception('''n is negative'''	)
  return [fib_recursive_term(_UpperCamelCase	) for i in range(n + 1	)]



def  snake_case_(_UpperCamelCase	)				->      list[int]:



  """simple docstring"""






  @functools.cache
  def fib_recursive_term(_UpperCamelCase	) -> int:
    if i < 0:
      raise Exception('''n is negative'''	)
    if i < 2:
      return i
    return fib_recursive_term(i - 1	) + fib_recursive_term(i - 2	)

  if n < 0:
    raise Exception('''n is negative'''	)
  return [fib_recursive_term(_UpperCamelCase	) for i in range(n + 1	)]



def  snake_case_(_UpperCamelCase	)				->      list[int]:



  """simple docstring"""






  if n < 0:
    raise Exception('''n is negative'''	)
  # Cache must be outside recursuive function
  # other it will reset every time it calls itself.
  _snake_case		=				{0: 0, 1: 1, 2: 1}  # Prefilled cache

  def rec_fn_memoized(_UpperCamelCase	) -> int:
    if num in cache:
      return cache[num]

    _snake_case		=				rec_fn_memoized(num - 1	) + rec_fn_memoized(num - 2	)
    _snake_case		=				value
    return value

  return [rec_fn_memoized(_UpperCamelCase	) for i in range(n + 1	)]



def  snake_case_(_UpperCamelCase	)				->      list[int]:



  """simple docstring"""






  if n < 0:
    raise Exception('''n is negative'''	)
  if n >= 1_475:
    raise Exception('''n is too large'''	)
  _snake_case		=				sqrt(5	)
  _snake_case		=				(1 + sqrt_a) / 2
  return [round(phi**i / sqrt_a	) for i in range(n + 1	)]


if __name__ == "__main__":
 __A     						=      30
 time_func(fib_iterative, num)
 time_func(fib_recursive, num)  # Around 3s runtime
 time_func(fib_recursive_cached, num)  # Around 0ms runtime
 time_func(fib_memoization, num)
 time_func(fib_binet, num)

