1603A.md (2121B)
1 Source: https://codeforces.com/problemset/problem/1603/A 2 3 A. Di-visible Confusion 4 5 time limit per test 6 7 1 second 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 YouKn0wWho has an integer sequence $a_1, a_2, \ldots, a_n$. He will perform the following operation until the sequence becomes empty: select an index $i$ such that $1 \le i \le |a|$ and $a_i$ is not divisible by $(i + 1)$, and erase this element from the sequence. Here $|a|$ is the length of sequence $a$ at the moment of operation. Note that the sequence $a$ changes and the next operation is performed on this changed sequence. 22 23 For example, if $a=[3,5,4,5]$, then he can select $i = 2$, because $a_2 = 5$ is not divisible by $i+1 = 3$. After this operation the sequence is $[3,4,5]$. 24 25 Help YouKn0wWho determine if it is possible to erase the whole sequence using the aforementioned operation. 26 27 Input 28 29 The first line contains a single integer $t$ ($1 \le t \le 10\,000$) — the number of test cases. 30 31 The first line of each test case contains a single integer $n$ ($1 \le n \le 10^5$). 32 33 The second line of each test case contains $n$ integers $a_1, a_2, \ldots, a_n$ ($1 \le a_i \le 10^9$). 34 35 It is guaranteed that the sum of $n$ over all test cases doesn't exceed $3 \cdot 10^5$. 36 37 Output 38 39 For each test case, print "YES" (without quotes) if it is possible to erase the whole sequence using the aforementioned operation, print "NO" (without quotes) otherwise. You can print each letter in any register (upper or lower). 40 41 Example 42 43 Input 44 45 ``` 46 5 47 3 48 1 2 3 49 1 50 2 51 2 52 7 7 53 10 54 384836991 191890310 576823355 782177068 404011431 818008580 954291757 160449218 155374934 840594328 55 8 56 6 69 696 69696 696969 6969696 69696969 696969696 57 ``` 58 59 Output 60 61 ``` 62 YES 63 NO 64 YES 65 YES 66 NO 67 ``` 68 69 Note 70 71 In the first test case, YouKn0wWho can perform the following operations (the erased elements are underlined): $[1, \underline{2}, 3] \rightarrow [\underline{1}, 3] \rightarrow [\underline{3}] \rightarrow [\,].$ 72 73 In the second test case, it is impossible to erase the sequence as $i$ can only be $1$, and when $i=1$, $a_1 = 2$ is divisible by $i + 1 = 2$.