B. Divisors of Two Integers codeforces

最新推荐文章于 2020-11-02 13:29:03 发布

LqingX

最新推荐文章于 2020-11-02 13:29:03 发布

阅读量340

点赞数

分类专栏： codeforces

本文链接：https://blog.csdn.net/weixin_43892738/article/details/86620121

版权

这道codeforces题目要求根据给定的两个整数的所有除数（包括1和自身）的排列，恢复原来的两个正整数。输入包含除数的数量n和n个除数，保证存在解。输出恢复的两个正整数。

摘要由CSDN通过智能技术生成

B. Divisors of Two Integers codeforces

time limit per test1 second
memory limit per test256 megabytes
inputstandard input
outputstandard output
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 11 and ?x) and all divisors of ?y (including 11 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 ?=4x=4 and ?=6y=6 then the given list can be any permutation of the list [1,2,4,1,2,3,6][1,2,4,1,2,3,6]. Some of the possible lists are: [1,1,2,4,6,3,2][1,1,2,4,6,3,2], [4,6,1,1,2,3,2][4,6,1,1,2,3,2] or [1,6,3,2,4,1,2][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≤?≤1282≤n≤128) — the number of divisors of ?x and ?y.

The second line of the input contains ?n integers ?1,?2,…,??d1,d2,…,dn (1≤??≤1041≤di≤104), 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.

Example
i