human
GCD of two numbers formed by n repeating x and y times | Return the Greatest common Divisor of two numbers ..
Prints Greatest Common Divisor of number formed by n repeating x times and y times ..
Finding GCD of x and y ..
Print n , g times ..
Driver code"
Solution in Python:
assistant
#Here is code to gCD of two numbers formed by n repeating x and y times and the other steps required.
 def gcd ( a , b ) :
	if ( a == 0 ) :
		return b
	return gcd ( b % a , a )
def findgcd ( n , x , y ) :
	g = gcd ( x , y )
	for i in range ( g ) :
		print ( n )
n = 123
x = 5
y = 2
findgcd ( n , x , y )