CSES Solutions - Common Divisors
You are given an array of N positive integers. Your task is to find two integers such that their greatest common divisor is as large as possible. Example: Input: N = 5, arr[] = {3, 14, 15, 7, 9}Output: 7Explanation: GCD(14, 7)=7 which is the maximum possible among all the pairs Input: arr[] = {1, 12