Choose k elements from an array so that their GCD is maximise. ↵
↵
Constraints:↵
N <= 3000↵
K <= N; K <= 100↵
Ai <= 10^10 (ten to the power of 10)↵
I tried an algorithm of enumerating all divisors of ai and find the largest divisors that exists in >= k elements but it TLE.↵
Can somebody help? Thanks in advance.
↵
Constraints:↵
N <= 3000↵
K <= N; K <= 100↵
Ai <= 10^10 (ten to the power of 10)↵
I tried an algorithm of enumerating all divisors of ai and find the largest divisors that exists in >= k elements but it TLE.↵
Can somebody help? Thanks in advance.