




from __future__ import annotations

import time

import numpy as np

lowerCamelCase__			:       str         =							[8, 5, 9, 7]
lowerCamelCase__			:       Union[str, Any]         =							[
    [2, 0, 1, 1],
    [0, 1, 2, 1],
    [4, 0, 0, 3],
    [0, 2, 1, 0],
    [1, 0, 3, 0],
]
lowerCamelCase__			:       Any         =							[
    [3, 2, 1, 4],
    [0, 2, 5, 2],
    [5, 1, 0, 5],
    [1, 5, 3, 0],
    [3, 0, 3, 3],
]





class 	lowerCamelCase_							:


 '''simple docstring'''







 def __init__(							self  :		str    ,    _lowerCAmelCase  :		list[int]    ,    _lowerCAmelCase  :		list[list[int]]    ,    _lowerCAmelCase  :		list[list[int]]    ,    ):
       SCREAMING_SNAKE_CASE_     						=      claim_vector
       SCREAMING_SNAKE_CASE_     						=      allocated_resources_table
       SCREAMING_SNAKE_CASE_     						=      maximum_claim_table



 def 				lowerCAmelCase_  (							self  :		Tuple						):
       return [
           sum(p_item[i] for p_item in self.__allocated_resources_table						)
           for i in range(len(self.__allocated_resources_table[0]						)						)
       ]



 def 				lowerCAmelCase_  (							self  :		str						):
       return np.array(self.__claim_vector						) - np.array(
           self.__processes_resource_summation()						)



 def 				lowerCAmelCase_  (							self  :		Any						):
       return [
           list(np.array(self.__maximum_claim_table[i]						) - np.array(_lowerCAmelCase						)						)
           for i, allocated_resource in enumerate(self.__allocated_resources_table						)
       ]



 def 				lowerCAmelCase_  (							self  :		Any						):
       return {self.__need().index(_lowerCAmelCase						): i for i in self.__need()}



 def 				lowerCAmelCase_  (							self  :		List[str]    ,    **_lowerCAmelCase  :		Optional[int]						):
       SCREAMING_SNAKE_CASE_     						=      self.__need()
       SCREAMING_SNAKE_CASE_     						=      self.__allocated_resources_table
       SCREAMING_SNAKE_CASE_     						=      self.__available_resources()
       SCREAMING_SNAKE_CASE_     						=      self.__need_index_manager()
       for kw, val in kwargs.items():
             if kw and val is True:
                   self.__pretty_data()
       print('_' * 50 + '\n'						)
       while need_list:
             SCREAMING_SNAKE_CASE_     						=      False
             for each_need in need_list:
                   SCREAMING_SNAKE_CASE_     						=      True
                   for index, need in enumerate(_lowerCAmelCase						):
                         if need > available_resources[index]:
                               SCREAMING_SNAKE_CASE_     						=      False
                               break
                   if execution:
                         SCREAMING_SNAKE_CASE_     						=      True
                         # get the original index of the process from ind_ctrl db
                         for original_need_index, need_clone in need_index_manager.items():
                               if each_need == need_clone:
                                     SCREAMING_SNAKE_CASE_     						=      original_need_index
                         print(F"Process {process_number + 1} is executing."						)
                         # remove the process run from stack
                         need_list.remove(_lowerCAmelCase						)
                         # update available/freed resources stack
                         SCREAMING_SNAKE_CASE_     						=      np.array(_lowerCAmelCase						) + np.array(
                             alloc_resources_table[process_number]						)
                         print(
                             'Updated available resource stack for processes: '
                             + ' '.join([str(_lowerCAmelCase						) for x in available_resources]						)						)
                         break
             if safe:
                   print('The process is in a safe state.\n'						)
             else:
                   print('System in unsafe state. Aborting...\n'						)
                   break




 def 				lowerCAmelCase_  (							self  :		int						):
       print(' ' * 9 + 'Allocated Resource Table'						)
       for item in self.__allocated_resources_table:
             print(
                 F"P{self.__allocated_resources_table.index(_lowerCAmelCase						) + 1}"
                 + ' '.join(F"{it:>8}" for it in item						)
                 + '\n'						)
       print(' ' * 9 + 'System Resource Table'						)
       for item in self.__maximum_claim_table:
             print(
                 F"P{self.__maximum_claim_table.index(_lowerCAmelCase						) + 1}"
                 + ' '.join(F"{it:>8}" for it in item						)
                 + '\n'						)
       print(
           'Current Usage by Active Processes: '
           + ' '.join(str(_lowerCAmelCase						) for x in self.__claim_vector						)						)
       print(
           'Initial Available Resources:       '
           + ' '.join(str(_lowerCAmelCase						) for x in self.__available_resources()						)						)
       time.sleep(1						)


if __name__ == "__main__":
   import doctest

   doctest.testmod()





def  UpperCAmelCase_							(				__UpperCAmelCase						:     Optional[Any]      ,      __UpperCAmelCase						:     Union[str, Any]							) ->			List[str]:
      SCREAMING_SNAKE_CASE_     						=      0
      while b > 0:
            if b & 1:
                  res += a

            a += a
            b >>= 1

      return res

def  UpperCAmelCase_							(				__UpperCAmelCase						:     str      ,      __UpperCAmelCase						:     int      ,      __UpperCAmelCase						:     Tuple							) ->			int:
      SCREAMING_SNAKE_CASE_     						=      0
      while b > 0:
            if b & 1:
                  SCREAMING_SNAKE_CASE_     						=      ((res % c) + (a % c)) % c

            a += a
            b >>= 1

      return res