hdu 5428

题意：有你n个数，找出所有数的所有因子，算上他本身，求最小的两个的乘积

如果不够2个，则输出-1

#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<cmath>
#include<cstring>
#include<string.h>
#include<queue>
#include<stack>
#include<list>
#include<map>
#include<set>
#include<vector>
using namespace std;
typedef long long int ll;
const int maxn =1e6;
const int maxm=10000;
const int mod =1e8+7;
const int INF=0x3f3f3f3f;
ll a[maxn];
int main()
{
	int t;scanf("%d",&t);
	while(t--)
	{
		memset(a,0,sizeof(a));
		int n;scanf("%d",&n);
		ll vis[maxn];ll cnt=0;
		memset(vis,0,sizeof(vis));
		for(ll i=0;i<n;i++)
		{
			scanf("%d",&a[i]);
			ll b=a[i];
			for(ll j=2;j<=sqrt(b);j++)
			{
				while(b%j==0)
				{
					vis[cnt++]=j;
					b/=j;
				}
			}
			if(b>1)vis[cnt++]=b;
		}
		sort(vis,vis+cnt);
		printf("%lld\n",cnt>=2 ? vis[0]*vis[1]:-1);
	}
	return 0;
}