partie2_ex62.py

Created by cahier-algo-2de-indice2019

Created on November 27, 2018

133 Bytes


def g(a,b):
    m=min(a,b)
    for k in range(1,m+1):
        if a%k==0 and b%k==0:
            p=k
    return(p)