Problem Description
There is a sequence of n positive integers. Fancycoder is addicted to learn their product, but this product may be extremely huge! However, it is lucky that FancyCoder only needs to find out one factor of this huge product: the smallest factor that contains more than 2 factors（including itself; i.e. 4 has 3 factors so that it is a qualified factor）. You need to find it out and print it. As we know, there may be none of such factors; in this occasion, please print -1 instead.
Input
The first line contains one integer T (1≤T≤15), which represents the number of testcases.
For each testcase, there are two lines:
1. The first line contains one integer denoting the value of n (1≤n≤100).
2. The second line contains n integers a1,…,an (1≤a1,…,an≤2×109), which denote these n positive integers.
For each testcase, there are two lines:
1. The first line contains one integer denoting the value of n (1≤n≤100).
2. The second line contains n integers a1,…,an (1≤a1,…,an≤2×109), which denote these n positive integers.
Output
Print T answers in T lines.
Sample Input
2
3
1 2 3
5
6 6 6 6 6
3
1 2 3
5
6 6 6 6 6
Sample Output
6
4
4
Source
对于每一个数字，它有用的部分其实只有它的所有质因子（包括相等的）。求出所有数的所有质因子中最小的两个，相乘就是答案。如果所有数字的质因子个数不到两个，那么就是无解。时间复杂度
O(n*sqrt(a))O(n∗sqrt(a))。
#include<iostream>
#include<cstdio>
#include<cstring>
#include<set>
#include<cmath>
#include<algorithm>
using namespace std;
#define ll long long
multiset<ll> s;
multiset<ll>::iterator it,it1;
int main()
{
int t;
scanf("%d",&t);
while(t--){
s.clear();
ll n;
scanf("%I64d",&n);
for(ll i=;i<n;i++){
ll m;
scanf("%I64d",&m);
for(ll j=;j*j<=m;j++){
if(m%j==){
while(m%j==){
s.insert(j);
m/=j;
}
}
}
if(m>) s.insert(m);
}
ll size=s.size(); if(size<) printf("-1\n");
else{
it=s.begin();
ll ans1=(*it);
it++;
ll ans2=(*it);
printf("%I64d\n",ans1*ans2);
}
}
return ;
}