Maximum Subarray With Equal Products

Find the length of the longest contiguous subarray whose product equals gcd times lcm of its elements. With n ≤ 100 and values ≤ 10, the core challenge is efficiently checking segments (e.g., via brute-force segment checks or by comparing prime-exponent representations).