B. Divisors of Two Integers

题目链接
Recently you have received two positive integer numbers x and y. You forgot them, but you remembered a shuffled list containing all divisors of x (including 1 and x) and all divisors of y (including 1 and y). If d is a divisor of both numbers x and y at the same time, there are two occurrences of d in the list.

For example, if x=4 and y=6 then the given list can be any permutation of the list [1,2,4,1,2,3,6]. Some of the possible lists are: [1,1,2,4,6,3,2], [4,6,1,1,2,3,2] or [1,6,3,2,4,1,2].

Your problem is to restore suitable positive integer numbers x and y that would yield the same list of divisors (possibly in different order).

It is guaranteed that the answer exists, i.e. the given list of divisors corresponds to some positive integers x and y.

Input
The first line contains one integer n (2≤n≤128) — the number of divisors of x and y.

The second line of the input contains n integers d1,d2,…,dn (1≤di≤10⁴), where di is either divisor of x or divisor of y. If a number is divisor of both numbers x and y then there are two copies of this number in the list.

Output
Print two positive integer numbers x and y — such numbers that merged list of their divisors is the permutation of the given list of integers. It is guaranteed that the answer exists.

input
10
10 2 8 1 2 4 1 20 4 5

output
20 8

题意:给你两个数的所有因子，让你找出这两个数字
题解:先按照降序排序，最大的一个数肯定是其中一个数，如果中间有两个数相同，那么这个数就是另外一个数，因为 4 的因子是 1 2 4 而不是1 2 2 4，所以如果出现两个相同的那么另外一个一定就是这个数

#include<bits/stdc++.h>
using namespace std;
int main(){
	int n,a[130];
	scanf("%d",&n);
	for(int i = 0;i < n;i++)
		scanf("%d",a + i);
	sort(a,a + n,greater<int>());
	for(int i = 1;i < n;i++)
		if(a[0] % a[i] != 0 || a[i] == a[i - 1]){
			printf("%d %d\n",a[0],a[i]);
			return 0;
		}
	return 0;
}