Status: IN
`common_factors` enumerates divisors in O(sqrt(gcd(a,b))) by iterating only up to the square root and pairing each divisor `i` with `g // i`, with a guard against double-counting perfect squares
Source: entries/2026/06/06/number-of-common-factors-solution.md