1656C.md (1840B)
1 Source: https://codeforces.com/problemset/problem/1656/C 2 3 C. Make Equal With Mod 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 You are given an array of $n$ non-negative integers $a_1, a_2, \ldots, a_n$. You can make the following operation: choose an integer $x \geq 2$ and replace each number of the array by the remainder when dividing that number by $x$, that is, for all $1 \leq i \leq n$ set $a_i$ to $a_i \bmod x$. 22 23 Determine if it is possible to make all the elements of the array equal by applying the operation zero or more times. 24 25 Input 26 27 The input consists of multiple test cases. The first line contains a single integer $t$ ($1 \leq t \leq 10^4$) — the number of test cases. Description of the test cases follows. 28 29 The first line of each test case contains an integer $n$ ($1 \leq n \leq 10^5$) — the length of the array. 30 31 The second line of each test case contains $n$ integers $a_1, a_2, \ldots, a_n$ ($0 \leq a_i \leq 10^9$) where $a_i$ is the $i$-th element of the array. 32 33 The sum of $n$ for all test cases is at most $2 \cdot 10^5$. 34 35 Output 36 37 For each test case, print a line with YES if you can make all elements of the list equal by applying the operation. Otherwise, print NO. 38 39 You may print each letter in any case (for example, "YES", "Yes", "yes", "yEs" will all be recognized as a positive answer). 40 41 Example 42 43 Input 44 45 ``` 46 4 47 48 4 49 50 2 5 6 8 51 52 3 53 54 1 1 1 55 56 5 57 58 4 1 7 0 8 59 60 4 61 62 5 9 17 5 63 ``` 64 65 Output 66 67 ``` 68 YES 69 YES 70 NO 71 YES 72 ``` 73 74 Note 75 76 In the first test case, one can apply the operation with $x = 3$ to obtain the array $[2, 2, 0, 2]$, and then apply the operation with $x = 2$ to obtain $[0, 0, 0, 0]$. 77 78 In the second test case, all numbers are already equal. 79 80 In the fourth test case, applying the operation with $x = 4$ results in the array $[1, 1, 1, 1]$.