Leetcode 2427. Number of Common Factors

Count how many positive integers divide both a and b — compute g = gcd(a, b) and return the number of divisors of g. With 1 ≤ a, b ≤ 1000 this is efficiently done by checking divisors up to sqrt(g).