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
Sample Output
6 4
Source
Recommend
只要找到最小的因子和次小的因子就行了
注意最后的答案是会爆int的,。
#include<iostream>
#include<cstring>
#include<cstdio>
#include<cmath>
#include<vector>
#include<algorithm>
using namespace std;
typedef long long LL;
const int inf = 0x3f3f3f3f;
int a[110];
int has[123456];
int p;
void wcb(int a)
{
for(int i=2; (LL)i*i<=(LL)a; i++)
while(a % i == 0)
has[p++] = i, a/=i;
if(a>1) has[p++] = a;
}
int main()
{
int i,j,k,m,n;
int t;
scanf("%d",&t);
while(t--)
{
scanf("%d",&n);
p = 0;
for(i=1; i<=n; i++)
{
scanf("%d",&k);
wcb(k);
}
if(p <2)
{
puts("-1");
continue;
}
sort(has,has+p);
//int pp=unique(has,has+p)-has;
if(has[1]<2)
{
puts("-1");
continue;
}
// for(i=0;i<p;i++)
// cout<<has[i]<<endl;
printf("%I64d\n",(LL)has[0] * has[1]);
}
return 0;
}