Submission #7744066

---

Source Code Expand

import math


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


def main():
    A, B = map(int, input().split())
    g = gcd(A, B)
    rt = int(math.sqrt(g))
    ans = set([1])
    for x in range(2, rt+1):
        if g % x == 0:
            ans.add(x)
            while g % x == 0:
                g //= x
    if g != 1:
        ans.add(g)
    print(len(ans))


if __name__ == "__main__":
    main()

Submission Info

Judge Result