"""simple docstring"""


def 					__a   (		A    ,				A      ):






     '''simple docstring'''



     while b:
          lowercase__ ,						lowercase__				 =							b, a % b
     return a







def 					__a   (		A    ,				A      ):






     '''simple docstring'''



     return a if b == 0 else euclidean_gcd_recursive(A    ,				a % b      )







def 					__a   (		):






     '''simple docstring'''



     print(f'''euclidean_gcd(3, 5) = {euclidean_gcd(3    ,				5      )}'''      )
     print(f'''euclidean_gcd(5, 3) = {euclidean_gcd(5    ,				3      )}'''      )
     print(f'''euclidean_gcd(1, 3) = {euclidean_gcd(1    ,				3      )}'''      )
     print(f'''euclidean_gcd(3, 6) = {euclidean_gcd(3    ,				6      )}'''      )
     print(f'''euclidean_gcd(6, 3) = {euclidean_gcd(6    ,				3      )}'''      )

     print(f'''euclidean_gcd_recursive(3, 5) = {euclidean_gcd_recursive(3    ,				5      )}'''      )
     print(f'''euclidean_gcd_recursive(5, 3) = {euclidean_gcd_recursive(5    ,				3      )}'''      )
     print(f'''euclidean_gcd_recursive(1, 3) = {euclidean_gcd_recursive(1    ,				3      )}'''      )
     print(f'''euclidean_gcd_recursive(3, 6) = {euclidean_gcd_recursive(3    ,				6      )}'''      )
     print(f'''euclidean_gcd_recursive(6, 3) = {euclidean_gcd_recursive(6    ,				3      )}'''      )


if __name__ == "__main__":
 main()





"""simple docstring"""


from collections import deque






class    a__    :


   def __init__(     self,				_UpperCAmelCase,				_UpperCAmelCase,				_UpperCAmelCase  ):
        '''simple docstring'''



        lowercase__				 =							process_name  # process name
        lowercase__				 =							arrival_time  # arrival time of the process
        # completion time of finished process or last interrupted time
        lowercase__				 =							arrival_time
        lowercase__				 =							burst_time  # remaining burst time
        lowercase__				 =							0  # total time of the process wait in ready queue
        lowercase__				 =							0  # time from arrival time to completion time






class    a__    :


   def __init__(     self,				_UpperCAmelCase,				_UpperCAmelCase,				_UpperCAmelCase,				_UpperCAmelCase,				):
        '''simple docstring'''



        lowercase__				 =							number_of_queues
        # time slice of queues that round robin algorithm applied
        lowercase__				 =							time_slices
        # unfinished process is in this ready_queue
        lowercase__				 =							queue
        # current time
        lowercase__				 =							current_time
        # finished process is in this sequence queue
        lowercase__				 =							deque()


   def 	snake_case__	(     self  ):
        '''simple docstring'''



        lowercase__				 =							[]
        for i in range(len(self.finish_queue  )  ):
             sequence.append(self.finish_queue[i].process_name  )
        return sequence


   def 	snake_case__	(     self,				_UpperCAmelCase  ):
        '''simple docstring'''



        lowercase__				 =							[]
        for i in range(len(_UpperCAmelCase  )  ):
             waiting_times.append(queue[i].waiting_time  )
        return waiting_times


   def 	snake_case__	(     self,				_UpperCAmelCase  ):
        '''simple docstring'''



        lowercase__				 =							[]
        for i in range(len(_UpperCAmelCase  )  ):
             turnaround_times.append(queue[i].turnaround_time  )
        return turnaround_times


   def 	snake_case__	(     self,				_UpperCAmelCase  ):
        '''simple docstring'''



        lowercase__				 =							[]
        for i in range(len(_UpperCAmelCase  )  ):
             completion_times.append(queue[i].stop_time  )
        return completion_times


   def 	snake_case__	(     self,				_UpperCAmelCase  ):
        '''simple docstring'''



        return [q.burst_time for q in queue]


   def 	snake_case__	(     self,				_UpperCAmelCase  ):
        '''simple docstring'''



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


   def 	snake_case__	(     self,				_UpperCAmelCase  ):
        '''simple docstring'''



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

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


   def 	snake_case__	(     self,				_UpperCAmelCase,				_UpperCAmelCase  ):
        '''simple docstring'''



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

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


   def 	snake_case__	(     self  ):
        '''simple docstring'''



        for i in range(self.number_of_queues - 1  ):
             lowercase__ ,						lowercase__				 =							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_:					Optional[int]     =					Process("P1", 0, 5_3)
 lowerCAmelCase_:					Union[str, Any]     =					Process("P2", 0, 1_7)
 lowerCAmelCase_:					str     =					Process("P3", 0, 6_8)
 lowerCAmelCase_:					int     =					Process("P4", 0, 2_4)
 lowerCAmelCase_:					Dict     =					3
 lowerCAmelCase_:					Any     =					[1_7, 2_5]
 lowerCAmelCase_:					Tuple     =					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_:					Any     =					Process("P1", 0, 5_3)
 lowerCAmelCase_:					Tuple     =					Process("P2", 0, 1_7)
 lowerCAmelCase_:					Optional[int]     =					Process("P3", 0, 6_8)
 lowerCAmelCase_:					List[Any]     =					Process("P4", 0, 2_4)
 lowerCAmelCase_:					Union[str, Any]     =					3
 lowerCAmelCase_:					Any     =					[1_7, 2_5]
 lowerCAmelCase_:					Optional[Any]     =					deque([Pa, Pa, Pa, Pa])
 lowerCAmelCase_:					Union[str, Any]     =					MLFQ(number_of_queues, time_slices, queue, 0)
 lowerCAmelCase_:					Tuple     =					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()}'
 )




