# Python program to find HCF or GCD
# Using Euclidean algorithm

def compute_hcf(x,y):
	while(y):
		x,y = y,x%y

	return x



hcf = compute_hcf(300,400)
print('The H.C.F. is',hcf)
6c0d805bf0939a14e64c4e5ff1b5ff69fef05c94
<mask token>

def compute_hcf(x, y):
    while y:
        x, y = y, x % y
    return x


<mask token>

def compute_hcf(x, y):
    while y:
        x, y = y, x % y
    return x


<mask token>
print('The H.C.F. is', hcf)

def compute_hcf(x, y):
    while y:
        x, y = y, x % y
    return x


hcf = compute_hcf(300, 400)
print('The H.C.F. is', hcf)

# Python program to find HCF or GCD
# Using Euclidean algorithm

def compute_hcf(x,y):
	while(y):
		x,y = y,x%y

	return x



hcf = compute_hcf(300,400)
print('The H.C.F. is',hcf)