

'''simple docstring'''

from __future__ import annotations

from statistics import mean


def    A_  ( snake_case      ,       snake_case      ,       snake_case ):
  SCREAMING_SNAKE_CASE:Tuple						      =					[0] * no_of_processes
  SCREAMING_SNAKE_CASE:str						      =					[0] * no_of_processes

  # Initialize remaining_time to waiting_time.

  for i in range(snake_case ):
    SCREAMING_SNAKE_CASE:int						      =					burst_time[i]
  SCREAMING_SNAKE_CASE:list[int]						      =					[]

  SCREAMING_SNAKE_CASE:Optional[int]						      =					0
  SCREAMING_SNAKE_CASE:Tuple						      =					0

  # When processes are not completed,
  # A process whose arrival time has passed \
  # and has remaining execution time is put into the ready_process.
  # The shortest process in the ready_process, target_process is executed.

  while completed != no_of_processes:
    SCREAMING_SNAKE_CASE:str						      =					[]
    SCREAMING_SNAKE_CASE:List[str]						      =					-1

    for i in range(snake_case ):
      if (arrival_time[i] <= total_time) and (remaining_time[i] > 0):
        ready_process.append(snake_case )

    if len(snake_case ) > 0:
      SCREAMING_SNAKE_CASE:Optional[Any]						      =					ready_process[0]
      for i in ready_process:
        if remaining_time[i] < remaining_time[target_process]:
          SCREAMING_SNAKE_CASE:int						      =					i
      total_time += burst_time[target_process]
      completed += 1
      SCREAMING_SNAKE_CASE:Optional[Any]						      =					0
      SCREAMING_SNAKE_CASE:Tuple						      =					(
          total_time - arrival_time[target_process] - burst_time[target_process]
      )
    else:
      total_time += 1

  return waiting_time


def    A_  ( snake_case      ,       snake_case      ,       snake_case ):
  SCREAMING_SNAKE_CASE:Tuple						      =					[0] * no_of_processes
  for i in range(snake_case ):
    SCREAMING_SNAKE_CASE:List[Any]						      =					burst_time[i] + waiting_time[i]
  return turn_around_time


if __name__ == "__main__":
    print("[TEST CASE 01]")

    A_       						=							4
    A_       						=							[2, 5, 3, 7]
    A_       						=							[0, 0, 0, 0]
    A_       						=							calculate_waitingtime(arrival_time, burst_time, no_of_processes)
    A_       						=							calculate_turnaroundtime(
        burst_time, no_of_processes, waiting_time
    )

    # Printing the Result
    print("PID\tBurst Time\tArrival Time\tWaiting Time\tTurnaround Time")
    for i, process_id in enumerate(list(range(1, 5))):
        print(
            f'''{process_id}\t{burst_time[i]}\t\t\t{arrival_time[i]}\t\t\t\t'''
            f'''{waiting_time[i]}\t\t\t\t{turn_around_time[i]}'''
        )
    print(f'''\nAverage waiting time = {mean(waiting_time):.5f}''')
    print(f'''Average turnaround time = {mean(turn_around_time):.5f}''')









'''simple docstring'''

from math import factorial





def    A_  ( snake_case      ,       snake_case ):

  # If either of the conditions are true, the function is being asked
  # to calculate a factorial of a negative number, which is not possible
  if n < k or k < 0:
    raise ValueError("Please enter positive integers for n and k where n >= k" )
  return factorial(snake_case ) // (factorial(snake_case ) * factorial(n - k ))


if __name__ == "__main__":
    print(
        "The number of five-card hands possible from a standard",
        f'''fifty-two card deck is: {combinations(52, 5)}\n''',
    )

    print(
        "If a class of 40 students must be arranged into groups of",
        f'''4 for group projects, there are {combinations(40, 4)} ways''',
        "to arrange them.\n",
    )

    print(
        "If 10 teams are competing in a Formula One race, there",
        f'''are {combinations(10, 3)} ways that first, second and''',
        "third place can be awarded.",
    )






