A11298 | $Turtle Tenacity: Continual Mods$

时间限制1s

内存限制256MB

通过 / 提交0/0

题目描述

Given an array $a_1, a_2, \ldots, a_n$ , determine whether it is possible to rearrange its elements into $b_1, b_2, \ldots, b_n$ , such that $b_1 \bmod b_2 \bmod \ldots \bmod b_n \neq 0$ . Here $x \bmod y$ denotes the remainder from dividing $x$ by $y$ . Also, the modulo operations are calculated from left to right. That is, $x \bmod y \bmod z = (x \bmod y) \bmod z$ . For example, $2024 \bmod 1000 \bmod 8 = (2024 \bmod 1000) \bmod 8 = 24 \bmod 8 = 0$ .

The first line of the input contains a single integer $t$ ( $1 \le t \le 10^4$ ) — the number of test cases. The first line of each test case contains a single integer $n$ ( $2 \le n \le 10^5$ ). The second line of each test case contains $n$ integers $a_1, a_2, \ldots, a_n$ ( $1 \le a_i \le 10^9$ ). The sum of $n$ over all test cases does not exceed $2 \cdot 10^5$ .

For each test case, output "YES" if it is possible, "NO" otherwise. You can output the answer in any case (upper or lower). For example, the strings "yEs", "yes", "Yes", and "YES" will be recognized as positive responses.

输入 #1

8
6
1 2 3 4 5 6
5
3 3 3 3 3
3
2 2 3
5
1 1 2 3 7
3
1 2 2
3
1 1 2
6
5 2 10 10 10 2
4
3 6 9 3

输出 #1

YES
NO
YES
NO
YES
NO
YES
NO

C++ 编辑器

输入

输出