Do you know what is called ``Coprime Sequence''? That is a sequence consists of nnpositive integers, and the GCD (Greatest Common Divisor) of them is equal to 1.
``Coprime Sequence'' is easy to find because of its restriction. But we can try to maximize the GCD of these integers by removing exactly one integer. Now given a sequence, please maximize the GCD of its elements.
Input
The first line of the input contains an integer T(1≤T≤10)T(1≤T≤10), denoting the number of test cases.
In each test case, there is an integer n(3≤n≤100000)n(3≤n≤100000) in the first line, denoting the number of integers in the sequence.
Then the following line consists of nn integers a1,a2,...,an(1≤ai≤109)a1,a2,...,an(1≤ai≤109), denoting the elements in the sequence.
Output
For each test case, print a single line containing a single integer, denoting the maximum GCD.
Sample Input
3 3 1 1 1 5 2 2 2 3 2 4 1 2 4 8
Sample Output
1 2 2
也算是暴力吧?通过求出从前面数i个数的gcd和从后面数i个数的gcd,来一点一点找。
其实这么求是方便求去除中间的数时剩余的数的gcd,他前面的a个数的gcd和他后面的b个数的gcd的gcd,就是除了这个数的其余的所有数的gcd。
#include<iostream>
#include<cmath>
#include<cstring>
using namespace std;
int gcd(int a,int b){
if(a<b){
int t=a;
a=b;b=t;
}
return b==0?a:gcd(b,a%b);
}
int a[1000005],q[1000005],h[1000005];
int main(){
int t;
cin>>t;
while(t--){
int n;
cin>>n;
memset(q,0,sizeof(q));
memset(h,0,sizeof(h));
int i;
for(i=0;i<n;i++){
cin>>a[i];
}
q[0]=a[0];
for(i=1;i<n-1;i++){
q[i]=gcd(q[i-1],a[i]);
}
h[n-1]=a[n-1];
for(i=n-2;i>0;i--){
h[i]=gcd(h[i+1],a[i]);
}
int ans=max(q[n-2],h[1]);
for(i=1;i<n-1;i++){
ans=max(ans,gcd(q[i-1],h[i+1]));
}
cout<<ans<<endl;
}
return 0;
}