simplify_fractions.py

def convertFracts(lst):
    n= len(lst)
    ans =[[0]*2 for _ in range(n)]
    for i in range(n):
        ans[i][0]=lst[i][0]/gcd(lst[i][0], lst[i][1])
        ans[i][1] = lst[i][1]/gcd(lst[i][0], lst[i][1])
    return ans

def gcd(a, b):
    """Return greatest common divisor using Euclid's Algorithm."""
    while b:      
        a, b = b, a % b
    return a