ZCMU 1571: Subarray GCD

Description

Given an array A1,A2...AN, you have to print the size of the largest contiguous subarray such that
GCD of all integers in that subarray is 1.

Formally,
For a subarray Ai,Ai+1...Aj where 1 ≤ i < j ≤ N to be valid: GCD(Ai,Ai+1...Aj) should be 1. You have to print the size of the largest valid subarray.

If no valid subarray exists, output -1.

Note:A single element is not considered as a subarray according to the definition of this problem.

Input

First line contains T, the number of testcases. Each testcase consists of N in one line followed by Nintegers in the next line.

Constraints

• 1 ≤ T ≤ 10
• 2 ≤ N ≤ 105
• 1 ≤ Ai ≤ 105

Output

For each testcase, print the required answer in one line.

Sample Input

2 2 7 2 3 2 2 4

Sample Output

2 -1

#include <stdio.h>
int gcd(int a,int b)
{
	int t;
    while(b)
    {
        t=a%b;
        a=b;
        b=t;
    }
    return a;
}
int main()
{
    int T,a,b,n;
    scanf("%d",&T);
    while(T--)
    {
        scanf("%d",&n);
        scanf("%d",&a);
        for(int i=1;i<n;i++)
        {
            scanf("%d",&b);
            a=gcd(a,b);
        }
        if(a==1)
            printf("%d\n",n);
        else
            printf("-1\n");
    }
    return 0;
}