




"""simple docstring"""






from collections import deque




class   a__			:





						def __init__(							self      :	Dict     ,a__      :	str     ,a__      :	int     ,a__      :	int)						->       None:




											"""simple docstring"""







											_lowerCAmelCase:Any									=  process_name  # process name
											_lowerCAmelCase:Tuple									=  arrival_time  # arrival time of the process
											# completion time of finished process or last interrupted time
											_lowerCAmelCase:Tuple									=  arrival_time
											_lowerCAmelCase:str									=  burst_time  # remaining burst time
											_lowerCAmelCase:Dict									=  0  # total time of the process wait in ready queue
											_lowerCAmelCase:Tuple									=  0  # time from arrival time to completion time




class   a__			:





						def __init__(							self      :	int     ,a__      :	int     ,a__      :	list[int]     ,a__      :	deque[Process]     ,a__      :	int     ,)						->       None:




											"""simple docstring"""







											_lowerCAmelCase:Union[str, Any]									=  number_of_queues
											# time slice of queues that round robin algorithm applied
											_lowerCAmelCase:Tuple									=  time_slices
											# unfinished process is in this ready_queue
											_lowerCAmelCase:str									=  queue
											# current time
											_lowerCAmelCase:Optional[int]									=  current_time
											# finished process is in this sequence queue
											_lowerCAmelCase:deque[Process]									=  deque()





						def       __UpperCamelCase     (							self      :	List[str])						->       list[str]:




											"""simple docstring"""







											_lowerCAmelCase:Union[str, Any]									=  []
											for i in range(len(self.finish_queue)):
																sequence.append(self.finish_queue[i].process_name)
											return sequence





						def       __UpperCamelCase     (							self      :	Dict     ,a__      :	list[Process])						->       list[int]:




											"""simple docstring"""







											_lowerCAmelCase:Optional[Any]									=  []
											for i in range(len(a__)):
																waiting_times.append(queue[i].waiting_time)
											return waiting_times





						def       __UpperCamelCase     (							self      :	List[Any]     ,a__      :	list[Process])						->       list[int]:




											"""simple docstring"""







											_lowerCAmelCase:Optional[Any]									=  []
											for i in range(len(a__)):
																turnaround_times.append(queue[i].turnaround_time)
											return turnaround_times





						def       __UpperCamelCase     (							self      :	Optional[int]     ,a__      :	list[Process])						->       list[int]:




											"""simple docstring"""







											_lowerCAmelCase:int									=  []
											for i in range(len(a__)):
																completion_times.append(queue[i].stop_time)
											return completion_times





						def       __UpperCamelCase     (							self      :	Optional[Any]     ,a__      :	deque[Process])						->       list[int]:




											"""simple docstring"""







											return [q.burst_time for q in queue]





						def       __UpperCamelCase     (							self      :	Optional[Any]     ,a__      :	Process)						->       int:




											"""simple docstring"""







											process.waiting_time += self.current_time - process.stop_time
											return process.waiting_time





						def       __UpperCamelCase     (							self      :	Optional[Any]     ,a__      :	deque[Process])						->       deque[Process]:




											"""simple docstring"""







											_lowerCAmelCase:deque[Process]									=  deque()  # sequence deque of finished process
											while len(a__) != 0:
																_lowerCAmelCase:Dict									=  ready_queue.popleft()  # current process

																# if process's arrival time is later than current time, update current time
																if self.current_time < cp.arrival_time:
																					self.current_time += cp.arrival_time

																# update waiting time of current process
																self.update_waiting_time(a__)
																# update current time
																self.current_time += cp.burst_time
																# finish the process and set the process's burst-time 0
																_lowerCAmelCase:Dict									=  0
																# set the process's turnaround time because it is finished
																_lowerCAmelCase:Any									=  self.current_time - cp.arrival_time
																# set the completion time
																_lowerCAmelCase:Union[str, Any]									=  self.current_time
																# add the process to queue that has finished queue
																finished.append(a__)

											self.finish_queue.extend(a__)  # add finished process to finish queue
											# FCFS will finish all remaining processes
											return finished





						def       __UpperCamelCase     (							self      :	int     ,a__      :	deque[Process]     ,a__      :	int)						->       tuple[deque[Process], deque[Process]]:




											"""simple docstring"""







											_lowerCAmelCase:deque[Process]									=  deque()  # sequence deque of terminated process
											# just for 1 cycle and unfinished processes will go back to queue
											for _ in range(len(a__)):
																_lowerCAmelCase:Optional[Any]									=  ready_queue.popleft()  # current process

																# if process's arrival time is later than current time, update current time
																if self.current_time < cp.arrival_time:
																					self.current_time += cp.arrival_time

																# update waiting time of unfinished processes
																self.update_waiting_time(a__)
																# if the burst time of process is bigger than time-slice
																if cp.burst_time > time_slice:
																					# use CPU for only time-slice
																					self.current_time += time_slice
																					# update remaining burst time
																					cp.burst_time -= time_slice
																					# update end point time
																					_lowerCAmelCase:str									=  self.current_time
																					# locate the process behind the queue because it is not finished
																					ready_queue.append(a__)
																else:
																					# use CPU for remaining burst time
																					self.current_time += cp.burst_time
																					# set burst time 0 because the process is finished
																					_lowerCAmelCase:List[Any]									=  0
																					# set the finish time
																					_lowerCAmelCase:int									=  self.current_time
																					# update the process' turnaround time because it is finished
																					_lowerCAmelCase:int									=  self.current_time - cp.arrival_time
																					# add the process to queue that has finished queue
																					finished.append(a__)

											self.finish_queue.extend(a__)  # add finished process to finish queue
											# return finished processes queue and remaining processes queue
											return finished, ready_queue







						def       __UpperCamelCase     (							self      :	Dict)						->       deque[Process]:




											"""simple docstring"""







											for i in range(self.number_of_queues - 1):
																_lowerCAmelCase							,   _lowerCAmelCase:Union[str, Any]									=  self.round_robin(
																    self.ready_queue     ,self.time_slices[i])
											#  the last queue has first_come_first_served algorithm
											self.first_come_first_served(self.ready_queue)

											return self.finish_queue


if __name__ == "__main__":
				import doctest

				UpperCamelCase__						=			Process('''P1''', 0, 5_3)
				UpperCamelCase__						=			Process('''P2''', 0, 1_7)
				UpperCamelCase__						=			Process('''P3''', 0, 6_8)
				UpperCamelCase__						=			Process('''P4''', 0, 2_4)
				UpperCamelCase__						=			3
				UpperCamelCase__						=			[1_7, 2_5]
				UpperCamelCase__						=			deque([Pa, Pa, Pa, Pa])

				if len(time_slices) != number_of_queues - 1:
								raise SystemExit(0)

				doctest.testmod(extraglobs={'''queue''': deque([Pa, Pa, Pa, Pa])})

				UpperCamelCase__						=			Process('''P1''', 0, 5_3)
				UpperCamelCase__						=			Process('''P2''', 0, 1_7)
				UpperCamelCase__						=			Process('''P3''', 0, 6_8)
				UpperCamelCase__						=			Process('''P4''', 0, 2_4)
				UpperCamelCase__						=			3
				UpperCamelCase__						=			[1_7, 2_5]
				UpperCamelCase__						=			deque([Pa, Pa, Pa, Pa])
				UpperCamelCase__						=			MLFQ(number_of_queues, time_slices, queue, 0)
				UpperCamelCase__						=			mlfq.multi_level_feedback_queue()

				# print total waiting times of processes(P1, P2, P3, P4)
				print(
				    F"waiting time:\
        \t\t\t{MLFQ.calculate_waiting_time(mlfq, [Pa, Pa, Pa, Pa])}"
				)
				# print completion times of processes(P1, P2, P3, P4)
				print(
				    F"completion time:\
        \t\t{MLFQ.calculate_completion_time(mlfq, [Pa, Pa, Pa, Pa])}"
				)
				# print total turnaround times of processes(P1, P2, P3, P4)
				print(
				    F"turnaround time:\
        \t\t{MLFQ.calculate_turnaround_time(mlfq, [Pa, Pa, Pa, Pa])}"
				)
				# print sequence of finished processes
				print(
				    F"sequence of finished processes:\
        {mlfq.calculate_sequence_of_finish_queue()}"
				)












"""simple docstring"""






def 							UpperCAmelCase		(		snake_case			:					int      ,       snake_case			:					int    ):
					return x if y == 0 else greatest_common_divisor(snake_case      ,       x % y    )





def 							UpperCAmelCase		(		snake_case			:					int      ,       snake_case			:					int    ):
					return (x * y) // greatest_common_divisor(snake_case      ,       snake_case    )





def 							UpperCAmelCase		(		snake_case			:					int = 20    ):
					_lowerCAmelCase:List[Any]									=  1
					for i in range(1      ,       n + 1    ):
										_lowerCAmelCase:List[str]									=  lcm(snake_case      ,       snake_case    )
					return g


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






