codility CommonPrimeDivisors

Question:codility Lesson10 MinPerimeterRectangle

My Answer:

def gcd(a,b):
    if (a % b == 0):
        return b
    else:
        return gcd(b,a%b)


def solution(A,B):
    cnt = 0
    for i in range(len(A)):
        a = A[i]
        b = B[i]
        gcdmax = gcd(a,b)
        while True:
            x = gcd(a,gcbmax)
            if x == 1:
                break
            a /= x
        while True:
            y = gcd(b,gcdmax)
            if y == 1:
                break
            b /= y

        cnt += 1 if a == 1 and b == 1 else 0
    return cnt