python GCD one liner.py

Posted 2021-05-09

def gcd(a, b):
	return max([n for n in range(1, min(a, b)+1) if a%n == 0 and b%n == 0])