Geeksforgeeks

Error

×

Leaderboard

Showing:

Handle | Score |
---|---|

@Ibrahim Nash | 6560 |

@blackshadows | 6400 |

@mb1973 | 5777 |

@Quandray | 5275 |

@akhayrutdinov | 5111 |

@saiujwal13083 | 5074 |

@kirtidee18 | 4398 |

@sanjay05 | 3762 |

@mantu_singh | 3654 |

@gfgaccount | 3601 |

@marius_valentin_dragoi | 3525 |

Complete Leaderboard | |

Handle | Score |

@anish5256 | 991 |

@vimleshpratapsingh321 | 980 |

@skj7 | 899 |

@akhileshkumar562002 | 862 |

@kanewilliamson123 | 854 |

@pradeeppatidar1999 | 852 |

@pd420786 | 813 |

@infilooop | 800 |

@bunnybug320 | 796 |

@smitabose7826 | 784 |

@wallflowe101 | 778 |

Complete Leaderboard |

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 <= 10^{5}

3. 2 <= arr[i] <= 10^{5}

**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

Login to report an issue on this page.

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

YesLoading...

Length of the Subsequence

...