RosettaCodeData/Task/Greatest-common-divisor/BASIC256/greatest-common-divisor-1.basic
2023-07-01 13:44:08 -04:00

17 lines
249 B
Text

function gcdI(x, y)
while y
t = y
y = x mod y
x = t
end while
return x
end function
# ------ test ------
a = 111111111111111
b = 11111
print : print "GCD(";a;", ";b;") = "; gcdI(a, b)
print : print "GCD(";a;", 111) = "; gcdI(a, 111)
end