





'''simple docstring'''

def 						UpperCamelCase				(							_lowerCamelCase					:					int       ):
    return 1 if digit in (0, 1) else (digit * factorial(digit - 1       ))





def 						UpperCamelCase				(							_lowerCamelCase					:					int       ):
    A__				=			0
    A__				=			number
    while duplicate > 0:
        A__,	A__				=			divmod(_lowerCamelCase						,       10       )
        fact_sum += factorial(_lowerCamelCase       )
    return fact_sum == number


if __name__ == "__main__":
  print("Program to check whether a number is a Krisnamurthy Number or not.")
  __lowerCAmelCase							:	Any			=int(input("Enter number: ").strip())
  print(
      f"""{number} is {"" if krishnamurthy(number) else "not "}a Krishnamurthy Number."""
  )










'''simple docstring'''

from __future__ import annotations

import time

import numpy as np

__lowerCAmelCase							:	Optional[Any]			=[8, 5, 9, 7]
__lowerCAmelCase							:	Optional[int]			=[
    [2, 0, 1, 1],
    [0, 1, 2, 1],
    [4, 0, 0, 3],
    [0, 2, 1, 0],
    [1, 0, 3, 0],
]
__lowerCAmelCase							:	List[Any]			=[
    [3, 2, 1, 4],
    [0, 2, 5, 2],
    [5, 1, 0, 5],
    [1, 5, 3, 0],
    [3, 0, 3, 3],
]






class    UpperCAmelCase	:
 def __init__(				self      :Optional[int]						,       lowercase_      :list[int]						,       lowercase_      :list[list[int]]						,       lowercase_      :list[list[int]]						,       )->							None:
     A__				=			claim_vector
     A__				=			allocated_resources_table
     A__				=			maximum_claim_table
 def      UpperCAmelCase_							(				self      :Union[str, Any]							)->							list[int]:
     return [
         sum(p_item[i] for p_item in self.__allocated_resources_table							)
         for i in range(len(self.__allocated_resources_table[0]							)							)
     ]
 def      UpperCAmelCase_							(				self      :Tuple							)->							list[int]:
     return np.array(self.__claim_vector							) - np.array(
         self.__processes_resource_summation()							)
 def      UpperCAmelCase_							(				self      :Dict							)->							list[list[int]]:
     return [
         list(np.array(self.__maximum_claim_table[i]							) - np.array(lowercase_							)							)
         for i, allocated_resource in enumerate(self.__allocated_resources_table							)
     ]
 def      UpperCAmelCase_							(				self      :Any							)->							dict[int, list[int]]:
     return {self.__need().index(lowercase_							): i for i in self.__need()}
 def      UpperCAmelCase_							(				self      :Tuple						,       **lowercase_      :List[str]							)->							None:
     A__				=			self.__need()
     A__				=			self.__allocated_resources_table
     A__				=			self.__available_resources()
     A__				=			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:
         A__				=			False
         for each_need in need_list:
             A__				=			True
             for index, need in enumerate(lowercase_							):
                 if need > available_resources[index]:
                     A__				=			False
                     break
             if execution:
                 A__				=			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:
                         A__				=			original_need_index
                 print(F"Process {process_number + 1} is executing."							)
                 # remove the process run from stack
                 need_list.remove(lowercase_							)
                 # update available/freed resources stack
                 A__				=			np.array(lowercase_							) + np.array(
                     alloc_resources_table[process_number]							)
                 print(
                     "Updated available resource stack for processes: "
                     + " ".join([str(lowercase_							) 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      UpperCAmelCase_							(				self      :Optional[Any]							)->							Tuple:
     print(" " * 9 + "Allocated Resource Table"							)
     for item in self.__allocated_resources_table:
         print(
             F"P{self.__allocated_resources_table.index(lowercase_							) + 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(lowercase_							) + 1}"
             + " ".join(F"{it:>8}" for it in item							)
             + "\n"							)
     print(
         "Current Usage by Active Processes: "
         + " ".join(str(lowercase_							) for x in self.__claim_vector							)							)
     print(
         "Initial Available Resources:       "
         + " ".join(str(lowercase_							) for x in self.__available_resources()							)							)
     time.sleep(1							)


if __name__ == "__main__":
  import doctest

  doctest.testmod()



