题目
求 g c d ( l c m ( a i , a j ) ∣ i < j ) gcd(lcm({a_i,a_j}) | i<j) gcd(lcm(ai,aj)∣i<j),其中 2 ≤ n ≤ 100000 , a i ≤ 2 e 6 2≤n≤100000,a_i≤2e6 2≤n≤100000,ai≤2e6。
g c d ( l c m ( a , b ) , l c m ( a , c ) , l c m ( a , d ) ) = l c m ( a , g c d ( b , c , d ) ) gcd(lcm(a,b), lcm(a,c), lcm(a,d)) = lcm(a, gcd(b,c,d)) gcd(lcm(a,b),lcm(a,c),lcm(a,d))=lcm(a,gcd(b,c,d))
#include<cmath>
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<set>
#include<map>
#include<list>
#include<stack>
#include<queue>
#include<vector>
#define cl (k<<1)
#define cr (k<<1|1)
#define Mid ((a[k].l+a[k].r)>>1)
#define mem(a,x) memset(a,x,sizeof(a))
using namespace std;
#define bug printf("???\n")
typedef long long LL;
const int Inf=0x3f3f3f3f;
const double eps=1e-7;
const int maxn=1e5+50;
//gcd(lcm(a,b), lcm(a,c), lcm(a,d))
// = lcm(a, gcd(b,c,d))
LL a[maxn], suf[maxn];
LL lcm(LL a,LL b){
return a*b/__gcd(a,b);
}
int main()
{
int n;
cin>>n;
for(int i=1; i<=n; i++){
scanf("%lld",&a[i]);
}
suf[n] = a[n];
for(int i=n-1; i>=1; i--){
suf[i] = __gcd(a[i],suf[i+1]);
}
LL ans=lcm(a[1], suf[2]);
for(int i=2; i<=n-1; i++){
ans = __gcd(ans, lcm(a[i], suf[i+1]));
}
printf("%lld\n",ans);
}