1902C.md (1866B)
1 Source: https://codeforces.com/problemset/problem/1902/C 2 3 C. Insert and Equalize 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 integer array $a_1, a_2, \dots, a_n$, all its elements are distinct. 22 23 First, you are asked to insert one more integer $a_{n+1}$ into this array. $a_{n+1}$ should not be equal to any of $a_1, a_2, \dots, a_n$. 24 25 Then, you will have to make all elements of the array equal. At the start, you choose a positive integer $x$ ($x \gt 0$). In one operation, you add $x$ to exactly one element of the array. Note that $x$ is the same for all operations. 26 27 What's the smallest number of operations it can take you to make all elements equal, after you choose $a_{n+1}$ and $x$? 28 29 Input 30 31 The first line contains a single integer $t$ ($1 \le t \le 10^4$) — the number of testcases. 32 33 The first line of each testcase contains a single integer $n$ ($1 \le n \le 2 \cdot 10^5$). 34 35 The second line contains $n$ integers $a_1, a_2, \dots, a_n$ ($-10^9 \le a_i \le 10^9$). All $a_i$ are distinct. 36 37 The sum of $n$ over all testcases doesn't exceed $2 \cdot 10^5$. 38 39 Output 40 41 For each testcase, print a single integer — the smallest number of operations it can take you to make all elements equal, after you choose integers $a_{n+1}$ and $x$. 42 43 Example 44 45 Input 46 47 ``` 48 3 49 50 3 51 52 1 2 3 53 54 5 55 56 1 -19 17 -3 -15 57 58 1 59 60 10 61 ``` 62 63 Output 64 65 ``` 66 6 67 27 68 1 69 ``` 70 71 Note 72 73 In the first testcase, you can choose $a_{n+1} = 4$, the array becomes $[1, 2, 3, 4]$. Then choose $x = 1$ and apply the operation $3$ times to the first element, $2$ times to the second element, $1$ time to the third element and $0$ times to the fourth element. 74 75 In the second testcase, you can choose $a_{n+1} = 13, x = 4$. 76 77 In the third testcase, you can choose $a_{n+1} = 9, x = 1$. Then apply the operation once to $a_{n+1}$.