






"""simple docstring"""







from math import isclose, sqrt






def       _lowerCAmelCase       (      lowerCAmelCase	,      lowerCAmelCase	,      lowerCAmelCase		):







       '''simple docstring'''
       UpperCAmelCase	    =			point_y / 4 / point_x
       UpperCAmelCase	    =			2 * normal_gradient / (1 + normal_gradient * normal_gradient)
       UpperCAmelCase	    =			(1 - normal_gradient * normal_gradient) / (
           1 + normal_gradient * normal_gradient
       )
       UpperCAmelCase	    =			(sa - ca * incoming_gradient) / (ca + sa * incoming_gradient)

       # to find the next point, solve the simultaeneous equations:
       # y^2 + 4x^2 = 100
       # y - b = m * (x - a)
       # ==> A x^2 + B x + C = 0
       UpperCAmelCase	    =			outgoing_gradient**2 + 4
       UpperCAmelCase	    =			2 * outgoing_gradient * (point_y - outgoing_gradient * point_x)
       UpperCAmelCase	    =			(point_y - outgoing_gradient * point_x) ** 2 - 100

       UpperCAmelCase	    =			(
           -linear_term - sqrt(linear_term**2 - 4 * quadratic_term * constant_term		)
       ) / (2 * quadratic_term)
       UpperCAmelCase	    =			(
           -linear_term + sqrt(linear_term**2 - 4 * quadratic_term * constant_term		)
       ) / (2 * quadratic_term)

       # two solutions, one of which is our input point
       UpperCAmelCase	    =			x_minus if isclose(lowerCAmelCase	,      lowerCAmelCase		) else x_plus
       UpperCAmelCase	    =			point_y + outgoing_gradient * (next_x - point_x)

       return next_x, next_y, outgoing_gradient






def       _lowerCAmelCase       (      lowerCAmelCase = 1.4	,      lowerCAmelCase = -9.6		):







       '''simple docstring'''
       UpperCAmelCase	    =			0
       UpperCAmelCase	    =			first_x_coord
       UpperCAmelCase	    =			first_y_coord
       UpperCAmelCase	    =			(10.1 - point_y) / (0.0 - point_x)

       while not (-0.01 <= point_x <= 0.01 and point_y > 0):
              UpperCAmelCase    ,       UpperCAmelCase    ,       UpperCAmelCase	    =			next_point(lowerCAmelCase	,      lowerCAmelCase	,      lowerCAmelCase		)
              num_reflections += 1

       return num_reflections


if __name__ == "__main__":
 print(F'{solution() = }')








"""simple docstring"""







from __future__ import annotations

import pandas as pd






def       _lowerCAmelCase       (      lowerCAmelCase	,      lowerCAmelCase	,      lowerCAmelCase		):







       '''simple docstring'''
       UpperCAmelCase	    =			[0] * no_of_processes
       UpperCAmelCase	    =			[0] * no_of_processes
       # Copy the burst time into remaining_time[]
       for i in range(lowerCAmelCase		):
              UpperCAmelCase	    =			burst_time[i]

       UpperCAmelCase	    =			0
       UpperCAmelCase	    =			0
       UpperCAmelCase	    =			999999999
       UpperCAmelCase	    =			0
       UpperCAmelCase	    =			False

       # Process until all processes are completed
       while complete != no_of_processes:
              for j in range(lowerCAmelCase		):
                     if arrival_time[j] <= increment_time and remaining_time[j] > 0:
                            if remaining_time[j] < minm:
                                   UpperCAmelCase	    =			remaining_time[j]
                                   UpperCAmelCase	    =			j
                                   UpperCAmelCase	    =			True

              if not check:
                     increment_time += 1
                     continue
              remaining_time[short] -= 1

              UpperCAmelCase	    =			remaining_time[short]
              if minm == 0:
                     UpperCAmelCase	    =			999999999

              if remaining_time[short] == 0:
                     complete += 1
                     UpperCAmelCase	    =			False

                     # Find finish time of current process
                     UpperCAmelCase	    =			increment_time + 1

                     # Calculate waiting time
                     UpperCAmelCase	    =			finish_time - arrival_time[short]
                     UpperCAmelCase	    =			finar - burst_time[short]

                     if waiting_time[short] < 0:
                            UpperCAmelCase	    =			0

        # Increment time
              increment_time += 1
       return waiting_time






def       _lowerCAmelCase       (      lowerCAmelCase	,      lowerCAmelCase	,      lowerCAmelCase		):







       '''simple docstring'''
       UpperCAmelCase	    =			[0] * no_of_processes
       for i in range(lowerCAmelCase		):
              UpperCAmelCase	    =			burst_time[i] + waiting_time[i]
       return turn_around_time






def       _lowerCAmelCase       (      lowerCAmelCase	,      lowerCAmelCase	,      lowerCAmelCase		):







       '''simple docstring'''
       UpperCAmelCase	    =			0
       UpperCAmelCase	    =			0
       for i in range(lowerCAmelCase		):
              UpperCAmelCase	    =			total_waiting_time + waiting_time[i]
              UpperCAmelCase	    =			total_turn_around_time + turn_around_time[i]
       print(F'''Average waiting time = {total_waiting_time / no_of_processes:.5f}'''		)
       print("""Average turn around time ="""	,      total_turn_around_time / no_of_processes		)


if __name__ == "__main__":
 print('''Enter how many process you want to analyze''')
 lowerCAmelCase_	:    Optional[Any]            =      int(input())
 lowerCAmelCase_	:    List[Any]            =      [0] * no_of_processes
 lowerCAmelCase_	:    Optional[Any]            =      [0] * no_of_processes
 lowerCAmelCase_	:    int            =      list(range(1, no_of_processes + 1))

 for i in range(no_of_processes):
  print('''Enter the arrival time and burst time for process:--''' + str(i + 1))
  lowerCAmelCase_     ,					lowerCAmelCase_	:    Optional[Any]            =      map(int, input().split())

 lowerCAmelCase_	:    str            =      calculate_waitingtime(arrival_time, burst_time, no_of_processes)

 lowerCAmelCase_	:    str            =      burst_time
 lowerCAmelCase_	:    List[Any]            =      no_of_processes
 lowerCAmelCase_	:    int            =      waiting_time
 lowerCAmelCase_	:    int            =      calculate_turnaroundtime(bt, n, wt)

 calculate_average_times(waiting_time, turn_around_time, no_of_processes)

 lowerCAmelCase_	:    List[Any]            =      pd.DataFrame(
     list(zip(processes, burst_time, arrival_time, waiting_time, turn_around_time)),
     columns=[
         '''Process''',
         '''BurstTime''',
         '''ArrivalTime''',
         '''WaitingTime''',
         '''TurnAroundTime''',
     ],
 )

 # Printing the dataFrame
 pd.set_option('''display.max_rows''', fcfs.shape[0] + 1)
 print(fcfs)
