Longest Geometric Progression
Easy Accuracy: 5.38% Submissions: 687 Points: 2

Given a set of numbers, find the Length of the Longest Geometrix Progression (LLGP) in it. The common ratio of GP must be an integer.

Input:

 

The first line of input contains an integer T denoting the number of test cases. Then T test cases follow. The first line of each test case contains an integer N denoting the size array A representing the set of numbers

The second line of each test case contains N space separated integers denoting elements of the array A[ ].

Output:

Print the length of the longest geometric progression for each test case in a new line.


Constraints:

1<= T <=100

1<= N <=1000

1<= A[ ] <=10000


Example:

Input:

6

5 7 15 10 20 29

Output:

3

to report an issue on this page.

Editorial

We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?

Yes

All Submissions

My Submissions:

Login to access your submissions.