CF1285F.Classical?

普及/提高-

通过率：0%

AC君温馨提醒

该题目为【codeforces】题库的题目，您提交的代码将被提交至codeforces进行远程评测，并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供，我们无法保证该服务的稳定性，若提交后无反应，请等待一段时间后再进行重试。

题目描述

Given an array $a$ , consisting of $n$ integers, find:

$$\max\limits_{1 \le i < j \le n} LCM(a_i,a_j), $$ </p><p>where $LCM(x, y)$ is the smallest positive integer that is divisible by both $x$ and $y$ . For example, $LCM(6, 8) = 24$ , $LCM(4, 12) = 12$ , $LCM(2, 3) = 6$$$.

输入格式

The first line contains an integer $n$ ( $2 \le n \le 10^5$ ) — the number of elements in the array $a$ .

The second line contains $n$ integers $a_1, a_2, \dots, a_n$ ( $1 \le a_i \le 10^5$ ) — the elements of the array $a$ .

输出格式

Print one integer, the maximum value of the least common multiple of two elements in the array $a$ .

输入输出样例

输入#1
```
3
13 35 77
```
输出#1
```
1001
```
输入#2
```
6
1 2 4 8 16 32
```
输出#2
```
32
```

首页