"""simple docstring"""




import numpy as np
from PIL import Image






def   UpperCAmelCase					(	UpperCamelCase__       ,    UpperCamelCase__       ,    UpperCamelCase__				):






							"""simple docstring"""





							A__	     =np.array(UpperCamelCase__				)
							if arr.shape[0] != arr.shape[1]:
														raise ValueError('The input array is not a square matrix'				)
							A__	     =0
							A__	     =0
							A__	     =0
							A__	     =0

							# compute the shape of the output matrix
							A__	     =(arr.shape[0] - size) // stride + 1
							# initialize the output matrix with zeros of shape maxpool_shape
							A__	     =np.zeros((maxpool_shape, maxpool_shape)				)

							while i < arr.shape[0]:
														if i + size > arr.shape[0]:
																					# if the end of the matrix is reached, break
																					break
														while j < arr.shape[1]:
																					# if the end of the matrix is reached, break
																					if j + size > arr.shape[1]:
																												break
																					# compute the maximum of the pooling matrix
																					A__	     =np.max(arr[i : i + size, j : j + size]				)
																					# shift the pooling matrix by stride of column pixels
																					j += stride
																					mat_j += 1

														# shift the pooling matrix by stride of row pixels
														i += stride
														mat_i += 1

														# reset the column index to 0
														A__	     =0
														A__	     =0

							return updated_arr






def   UpperCAmelCase					(	UpperCamelCase__       ,    UpperCamelCase__       ,    UpperCamelCase__				):






							"""simple docstring"""





							A__	     =np.array(UpperCamelCase__				)
							if arr.shape[0] != arr.shape[1]:
														raise ValueError('The input array is not a square matrix'				)
							A__	     =0
							A__	     =0
							A__	     =0
							A__	     =0

							# compute the shape of the output matrix
							A__	     =(arr.shape[0] - size) // stride + 1
							# initialize the output matrix with zeros of shape avgpool_shape
							A__	     =np.zeros((avgpool_shape, avgpool_shape)				)

							while i < arr.shape[0]:
														# if the end of the matrix is reached, break
														if i + size > arr.shape[0]:
																					break
														while j < arr.shape[1]:
																					# if the end of the matrix is reached, break
																					if j + size > arr.shape[1]:
																												break
																					# compute the average of the pooling matrix
																					A__	     =int(np.average(arr[i : i + size, j : j + size]				)				)
																					# shift the pooling matrix by stride of column pixels
																					j += stride
																					mat_j += 1

														# shift the pooling matrix by stride of row pixels
														i += stride
														mat_i += 1
														# reset the column index to 0
														A__	     =0
														A__	     =0

							return updated_arr


# Main Function
if __name__ == "__main__":
				from doctest import testmod

				testmod(name="avgpooling", verbose=True)

				# Loading the image
				__lowerCamelCase											=  Image.open("path_to_image")

				# Converting the image to numpy array and maxpooling, displaying the result
				# Ensure that the image is a square matrix

				Image.fromarray(maxpooling(np.array(image), size=3, stride=2)).show()

				# Converting the image to numpy array and averagepooling, displaying the result
				# Ensure that the image is a square matrix

				Image.fromarray(avgpooling(np.array(image), size=3, stride=2)).show()






"""simple docstring"""




from __future__ import annotations

import pandas as pd






def   UpperCAmelCase					(	UpperCamelCase__       ,    UpperCamelCase__       ,    UpperCamelCase__				):






							"""simple docstring"""





							A__	     =							[0] * no_of_processes
							A__	     =							[0] * no_of_processes
							# Copy the burst time into remaining_time[]
							for i in range(UpperCamelCase__				):
														A__	     =							burst_time[i]

							A__	     =							0
							A__	     =							0
							A__	     =							999_999_999
							A__	     =							0
							A__	     =							False

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

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

														A__	     =							remaining_time[short]
														if minm == 0:
																					A__	     =							999_999_999

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

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

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

																					if waiting_time[short] < 0:
																												A__	     =							0

        # Increment time
														increment_time += 1
							return waiting_time






def   UpperCAmelCase					(	UpperCamelCase__       ,    UpperCamelCase__       ,    UpperCamelCase__				):






							"""simple docstring"""





							A__	     =							[0] * no_of_processes
							for i in range(UpperCamelCase__				):
														A__	     =							burst_time[i] + waiting_time[i]
							return turn_around_time






def   UpperCAmelCase					(	UpperCamelCase__       ,    UpperCamelCase__       ,    UpperCamelCase__				):






							"""simple docstring"""





							A__	     =							0
							A__	     =							0
							for i in range(UpperCamelCase__				):
														A__	     =							total_waiting_time + waiting_time[i]
														A__	     =							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											=  int(input())
				__lowerCamelCase											=  [0] * no_of_processes
				__lowerCamelCase											=  [0] * no_of_processes
				__lowerCamelCase											=  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											=  map(int, input().split())

				__lowerCamelCase											=  calculate_waitingtime(arrival_time, burst_time, no_of_processes)

				__lowerCamelCase											=  burst_time
				__lowerCamelCase											=  no_of_processes
				__lowerCamelCase											=  waiting_time
				__lowerCamelCase											=  calculate_turnaroundtime(bt, n, wt)

				calculate_average_times(waiting_time, turn_around_time, no_of_processes)

				__lowerCamelCase											=  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)





