Codeforces Round #560 (Div. 3) -> D. Almost All Divisors

D. Almost All Divisors

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≤10⁶), 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.

Example
input

2
8
8 2 12 6 4 24 16 3
1
2

output

48
4

AC:

#include<iostream>
#include<algorithm>
#include<string>
#include<cmath>
#include<cstring>
#include<queue>
using namespace std;
#define ll long long
#define db double
#define FOPEN freopen("C:\\Users\\14016\\Desktop\\cad.txt","r",stdin)

int main()
{
	//FOPEN;
	int t;
	cin>>t;
	while(t--)
	{
		int n;
		int bj[1000005]= {0};
		cin>>n;
		ll a[305];
		for(int i=1; i<=n; i++)
		{
			cin>>a[i];
			bj[a[i]]++;
		}
		sort(a+1,a+n+1);
		bool flag=true;
		ll shu=a[n]*a[1];

		ll j;
		for(j=n-1; j>=1; j--)
		{
			if(shu%a[j]!=0)
			{
				flag=false;
				break;
				goto aa;
			}
		}
		for(j=2; j*j<=shu; j++)
		{
			if(shu%j==0)
			{
				if(bj[j]==0||bj[shu/j]==0)
				{
					flag=false;
					break;
				}
			}
		}
aa:
		if(flag)
		{
			cout<<shu<<endl;
		}
		else cout<<-1<<endl;
	}
}

解题：

核心思想：如果可以求出，最后的求得数一定是给出因数的最大数和最小数的乘积
理由：假设最后求得的数命名为m，m一定会有一个除自身外最大的因数，那么当m除以这个因数得到的结果则为m最小的因数（不包括1），那么用给出序列中的最小值与最大值相乘即可得出m的值

然后再进行判断m是否能将序列中的值整除，以及得到的商是否存在于序列中，否则不能求出答案则输出-1

bingo！