cf 560 div3 -D

We guessed some integer number x. You are given a list of almost all its divisors. Almost all means that there are all divisors except 1 and x in the list.

Your task is to find the minimum possible integer x that can be the guessed number, or say that the input data is contradictory and it is impossible to find such number.

You have to answer t independent queries.

Input
The first line of the input contains one integer t (1≤t≤25) — the number of queries. Then t queries follow.

The first line of the query contains one integer n (1≤n≤300) — the number of divisors in the list.

The second line of the query contains n integers d1,d2,…,dn (2≤di≤106), where di is the i-th divisor of the guessed number. It is guaranteed that all values di are distinct.

Output
For each query print the answer to it.

If the input data in the query is contradictory and it is impossible to find such number x that the given list of divisors is the list of almost all its divisors, print -1. Otherwise print the minimum possible x.
题意：给了一堆子数，是一个数的除1和它本身以外的全部的除数，求该数，求不出来就-1

题解：观察一下数字的组成和找一下规律，不难发现，如果用这些数组成，那么原来的数，必定是最小的数和最大的数的乘积（假设可以组成），很显然的结论，因为除最小的数，得出的必定是最大的数。然后可以求出该数，用该数分别和每一个除数求模，O（n）时间就可以判断是否每个数是否均为除数，有一个不是就输出-1。
但没有结束，因为给的是所有的除数，所以要判断除数的个数是否对应，即求出该数的所有除数的个数，和n相比。求的时候要用欧拉筛

for(i=2;i<=m;i++){
            if(k%i==0) j=j+2;
        }
        if(m*m==k) j--;

最后一步要排除根号本身是除数导致多算了一次
注意
这个题是要long long的，因为10的6次方相乘，int不够，但在转化long long的时候不能直接用

k=1LL*a[0]*a[n-1];

要写*1LL，这样可以避免转化导致的溢出，不然会出现0，-1之类的结果，不准确