Preview:
def find_gcd(m, n):
    while n:
        m, n = n, m % n
    return m

m, n = map(int, input().split())

gcd = find_gcd(m, n)
print(gcd)
downloadDownload PNG downloadDownload JPEG downloadDownload SVG

Tip: You can change the style, width & colours of the snippet with the inspect tool before clicking Download!

Click to optimize width for Twitter