human
Number of continuous reductions of A from B or B from A to make them ( 1 , 1 ) | Function to find the minimum number of steps required.
Condition to check if it is not possible to reach.
Condition to check if the pair is reached to 1 , 1.
Condition to change the A as the maximum element.
Driver Code"
How can the above be solved in Python?
 Write me a code to number of continuous reductions of A from B or B from A to make them ( 1 , 1 ) and the other steps required?
assistant
#Here is code to number of continuous reductions of A from B or B from A to make them ( 1 , 1 ) and the other steps required.
 def minimumSteps ( a , b , c ) :
	if a < 1 or b < 1 :
		return - 1
	if a == 1 and b == 1 :
		return c
	if a < b :
		a , b = b , a
	return minimumSteps ( a - b , b , c + 1 )
if __name__ == " _ _ main _ _ " :
	a = 75 ; b = 17
	print ( minimumSteps ( a , b , 0 ) )