Leaderboard
Showing:
Length of the Subsequence
Easy Accuracy: 56.98% Submissions: 165 Points: 2

Given an array arr of positive integers of size N, the task is to find the length of the longest subsequence such that gcd of the subsequence is greater than one.

Input:
1. The first line of the input contains a single integer T denoting the number of test cases. The description of T test cases follows.
2. The first line of each test case contains a single integer N.
3. The next line contains N space-separated positive integers.


Output: For each test case, print the length of the subsequence
Constraints:
1. 1 <= T <= 5

2. 1 <= N <= 105
3. 2 <= arr[i] <= 105

Example:
Input:

2
2
2 9
5
2 3 4 5 6

Output:
1
3

Explanation:
Test Case 2:
Select the subsequence {2, 4, 6}, gcd is greater than 1 and longest possible subsequence

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.

Length of the Subsequence

Output Window