The simplest problem on earth

Problem description. Given an array of size N .You need to find maximum subarray (not necessarily contiguous) which is having its GCD (greatest common divisor) as K .return its length as output. Input - The first line of the input contains a single integer T denoting the number of test cases. The description of T test cases follows - The first line of each test case contains a single integer