


from collections import deque





class   __a      :
	def __init__(       self    ,			lowerCAmelCase__    ,			lowerCAmelCase__    ,			lowerCAmelCase__			) ->    None:




								'''simple docstring'''
								lowercase__:       List[str]        =       process_name  # process name
								lowercase__:       int        =       arrival_time  # arrival time of the process
								# completion time of finished process or last interrupted time
								lowercase__:       Optional[Any]        =       arrival_time
								lowercase__:       str        =       burst_time  # remaining burst time
								lowercase__:       Optional[Any]        =       0  # total time of the process wait in ready queue
								lowercase__:       Any        =       0  # time from arrival time to completion time





class   __a      :
	def __init__(       self    ,			lowerCAmelCase__    ,			lowerCAmelCase__    ,			lowerCAmelCase__    ,			lowerCAmelCase__    ,			) ->    None:




								'''simple docstring'''
								lowercase__:       Tuple        =       number_of_queues
								# time slice of queues that round robin algorithm applied
								lowercase__:       Union[str, Any]        =       time_slices
								# unfinished process is in this ready_queue
								lowercase__:       Optional[int]        =       queue
								# current time
								lowercase__:       Optional[Any]        =       current_time
								# finished process is in this sequence queue
								lowercase__:       deque[Process]        =       deque()
	def 		SCREAMING_SNAKE_CASE__       (       self			) ->    list[str]:




								'''simple docstring'''
								lowercase__:       Union[str, Any]        =       []
								for i in range(len(self.finish_queue			)			):
															sequence.append(self.finish_queue[i].process_name			)
								return sequence
	def 		SCREAMING_SNAKE_CASE__       (       self    ,			lowerCAmelCase__			) ->    list[int]:




								'''simple docstring'''
								lowercase__:       Optional[int]        =       []
								for i in range(len(lowerCAmelCase__			)			):
															waiting_times.append(queue[i].waiting_time			)
								return waiting_times
	def 		SCREAMING_SNAKE_CASE__       (       self    ,			lowerCAmelCase__			) ->    list[int]:




								'''simple docstring'''
								lowercase__:       Any        =       []
								for i in range(len(lowerCAmelCase__			)			):
															turnaround_times.append(queue[i].turnaround_time			)
								return turnaround_times
	def 		SCREAMING_SNAKE_CASE__       (       self    ,			lowerCAmelCase__			) ->    list[int]:




								'''simple docstring'''
								lowercase__:       Union[str, Any]        =       []
								for i in range(len(lowerCAmelCase__			)			):
															completion_times.append(queue[i].stop_time			)
								return completion_times
	def 		SCREAMING_SNAKE_CASE__       (       self    ,			lowerCAmelCase__			) ->    list[int]:




								'''simple docstring'''
								return [q.burst_time for q in queue]
	def 		SCREAMING_SNAKE_CASE__       (       self    ,			lowerCAmelCase__			) ->    int:




								'''simple docstring'''
								process.waiting_time += self.current_time - process.stop_time
								return process.waiting_time
	def 		SCREAMING_SNAKE_CASE__       (       self    ,			lowerCAmelCase__			) ->    deque[Process]:




								'''simple docstring'''
								lowercase__:       deque[Process]        =       deque()  # sequence deque of finished process
								while len(lowerCAmelCase__			) != 0:
															lowercase__:       str        =       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(lowerCAmelCase__			)
															# update current time
															self.current_time += cp.burst_time
															# finish the process and set the process's burst-time 0
															lowercase__:       Any        =       0
															# set the process's turnaround time because it is finished
															lowercase__:       int        =       self.current_time - cp.arrival_time
															# set the completion time
															lowercase__:       Optional[Any]        =       self.current_time
															# add the process to queue that has finished queue
															finished.append(lowerCAmelCase__			)

								self.finish_queue.extend(lowerCAmelCase__			)  # add finished process to finish queue
								# FCFS will finish all remaining processes
								return finished
	def 		SCREAMING_SNAKE_CASE__       (       self    ,			lowerCAmelCase__    ,			lowerCAmelCase__			) ->    tuple[deque[Process], deque[Process]]:




								'''simple docstring'''
								lowercase__:       deque[Process]        =       deque()  # sequence deque of terminated process
								# just for 1 cycle and unfinished processes will go back to queue
								for _ in range(len(lowerCAmelCase__			)			):
															lowercase__:       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(lowerCAmelCase__			)
															# 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
																						lowercase__:       List[str]        =       self.current_time
																						# locate the process behind the queue because it is not finished
																						ready_queue.append(lowerCAmelCase__			)
															else:
																						# use CPU for remaining burst time
																						self.current_time += cp.burst_time
																						# set burst time 0 because the process is finished
																						lowercase__:       Optional[Any]        =       0
																						# set the finish time
																						lowercase__:       int        =       self.current_time
																						# update the process' turnaround time because it is finished
																						lowercase__:       Any        =       self.current_time - cp.arrival_time
																						# add the process to queue that has finished queue
																						finished.append(lowerCAmelCase__			)

								self.finish_queue.extend(lowerCAmelCase__			)  # add finished process to finish queue
								# return finished processes queue and remaining processes queue
								return finished, ready_queue
	def 		SCREAMING_SNAKE_CASE__       (       self			) ->    deque[Process]:




								'''simple docstring'''

								#  all queues except last one have round_robin algorithm
								for i in range(self.number_of_queues - 1			):
															lowercase__:       str        =       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

	__lowerCAmelCase			=							Process('''P1''', 0, 53)
	__lowerCAmelCase			=							Process('''P2''', 0, 17)
	__lowerCAmelCase			=							Process('''P3''', 0, 68)
	__lowerCAmelCase			=							Process('''P4''', 0, 24)
	__lowerCAmelCase			=							3
	__lowerCAmelCase			=							[17, 25]
	__lowerCAmelCase			=							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])})

	__lowerCAmelCase			=							Process('''P1''', 0, 53)
	__lowerCAmelCase			=							Process('''P2''', 0, 17)
	__lowerCAmelCase			=							Process('''P3''', 0, 68)
	__lowerCAmelCase			=							Process('''P4''', 0, 24)
	__lowerCAmelCase			=							3
	__lowerCAmelCase			=							[17, 25]
	__lowerCAmelCase			=							deque([Pa, Pa, Pa, Pa])
	__lowerCAmelCase			=							MLFQ(number_of_queues, time_slices, queue, 0)
	__lowerCAmelCase			=							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()}'''
	)






from __future__ import annotations




def        snake_case_					(  snake_case      ,							snake_case					)  ->    list[str]:
       if nth_term == "":
              return [""]
       lowercase__:       Tuple        =       int(snake_case					)
       lowercase__:       int        =       int(snake_case					)
       lowercase__:       list[str]        =       []
       for temp in range(int(snake_case					)					):
              series.append(f'1 / {pow(temp + 1      ,							int(snake_case					)					)}' if series else '1'					)
       return series


if __name__ == "__main__":
 import doctest

 doctest.testmod()

 __lowerCAmelCase			=							int(input('''Enter the last number (nth term) of the P-Series'''))
 __lowerCAmelCase			=							int(input('''Enter the power for  P-Series'''))
 print('''Formula of P-Series => 1+1/2^p+1/3^p ..... 1/n^p''')
 print(p_series(nth_term, power))


