1165D.md (1375B)
1 Source: https://codeforces.com/problemset/problem/1165/D 2 3 D. Almost All Divisors 4 5 time limit per test 6 7 2 seconds 8 9 memory limit per test 10 11 256 megabytes 12 13 input 14 15 standard input 16 17 output 18 19 standard output 20 21 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. 22 23 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. 24 25 You have to answer $t$ independent queries. 26 27 Input 28 29 The first line of the input contains one integer $t$ ($1 \le t \le 25$) — the number of queries. Then $t$ queries follow. 30 31 The first line of the query contains one integer $n$ ($1 \le n \le 300$) — the number of divisors in the list. 32 33 The second line of the query contains $n$ integers $d_1, d_2, \dots, d_n$ ($2 \le d_i \le 10^6$), where $d_i$ is the $i$-th divisor of the guessed number. It is guaranteed that all values $d_i$ are distinct. 34 35 Output 36 37 For each query print the answer to it. 38 39 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$. 40 41 Example 42 43 Input 44 45 ``` 46 2 47 8 48 8 2 12 6 4 24 16 3 49 1 50 2 51 ``` 52 53 Output 54 55 ``` 56 48 57 4 58 ```