1521B.md (2343B)
1 Source: https://codeforces.com/problemset/problem/1521/B 2 3 B. Nastia and a Good Array 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 Nastia has received an array of $n$ positive integers as a gift. 22 23 She calls such an array $a$ good that for all $i$ ($2 \le i \le n$) takes place $gcd(a_{i - 1}, a_{i}) = 1$, where $gcd(u, v)$ denotes the [greatest common divisor (GCD)](https://en.wikipedia.org/wiki/Greatest_common_divisor) of integers $u$ and $v$. 24 25 You can perform the operation: select two different indices $i, j$ ($1 \le i, j \le n$, $i \neq j$) and two integers $x, y$ ($1 \le x, y \le 2 \cdot 10^9$) so that $\min{(a_i, a_j)} = \min{(x, y)}$. Then change $a_i$ to $x$ and $a_j$ to $y$. 26 27 The girl asks you to make the array good using at most $n$ operations. 28 29 It can be proven that this is always possible. 30 31 Input 32 33 The first line contains a single integer $t$ ($1 \le t \le 10\,000$) — the number of test cases. 34 35 The first line of each test case contains a single integer $n$ ($1 \le n \le 10^5$) — the length of the array. 36 37 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 array which Nastia has received as a gift. 38 39 It's guaranteed that the sum of $n$ in one test doesn't exceed $2 \cdot 10^5$. 40 41 Output 42 43 For each of $t$ test cases print a single integer $k$ ($0 \le k \le n$) — the number of operations. You don't need to minimize this number. 44 45 In each of the next $k$ lines print $4$ integers $i$, $j$, $x$, $y$ ($1 \le i \neq j \le n$, $1 \le x, y \le 2 \cdot 10^9$) so that $\min{(a_i, a_j)} = \min{(x, y)}$ — in this manner you replace $a_i$ with $x$ and $a_j$ with $y$. 46 47 If there are multiple answers, print any. 48 49 Example 50 51 Input 52 53 ``` 54 2 55 5 56 9 6 3 11 15 57 3 58 7 5 13 59 ``` 60 61 Output 62 63 ``` 64 2 65 1 5 11 9 66 2 5 7 6 67 0 68 ``` 69 70 Note 71 72 Consider the first test case. 73 74 Initially $a = [9, 6, 3, 11, 15]$. 75 76 In the first operation replace $a_1$ with $11$ and $a_5$ with $9$. It's valid, because $\min{(a_1, a_5)} = \min{(11, 9)} = 9$. 77 78 After this $a = [11, 6, 3, 11, 9]$. 79 80 In the second operation replace $a_2$ with $7$ and $a_5$ with $6$. It's valid, because $\min{(a_2, a_5)} = \min{(7, 6)} = 6$. 81 82 After this $a = [11, 7, 3, 11, 6]$ — a good array. 83 84 In the second test case, the initial array is already good.