human
Check if it is possible to reach ( X , Y ) from ( 1 , 0 ) by given steps | Function to find the GCD of two numbers a and b.
Base Case.
Recursively find the GCD.
Function to check if ( x , y ) can be reached from ( 1 , 0 ) from given moves.
If GCD is 1 , then pr " Yes ".
Driver Code.
Given X and Y.
Function call"
How can the above be solved in Python?

Can you provide a code to check if it is possible to reach ( X , Y ) from ( 1 , 0 ) by given steps and the other steps required?
assistant
#Here is code to check if it is possible to reach ( X , Y ) from ( 1 , 0 ) by given steps and the other steps required.
 def GCD ( a , b ) :
	if ( b == 0 ) :
		return a
	else :
		return GCD ( b , a % b )
def check ( x , y ) :
	if ( GCD ( x , y ) == 1 ) :
		print ( " Yes " )
	else :
		print ( " No " )
if __name__ == ' _ _ main _ _ ' :
	X = 2
	Y = 7
	check ( X , Y )