codeforces-scrape

Codeforces scraped problems and editorials
git clone git://git.laack.co/codeforces-scrape.git
Log | Files | Refs | README

1598C.md (2121B)


      1 Source: https://codeforces.com/problemset/problem/1598/C
      2 
      3 C. Delete Two Elements
      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 Monocarp has got an array $a$ consisting of $n$ integers. Let's denote $k$ as the mathematic mean of these elements (note that it's possible that $k$ is not an integer).
     22 
     23 The mathematic mean of an array of $n$ elements is the sum of elements divided by the number of these elements (i. e. sum divided by $n$).
     24 
     25 Monocarp wants to delete exactly two elements from $a$ so that the mathematic mean of the remaining $(n - 2)$ elements is still equal to $k$.
     26 
     27 Your task is to calculate the number of pairs of positions $[i, j]$ ($i \lt j$) such that if the elements on these positions are deleted, the mathematic mean of $(n - 2)$ remaining elements is equal to $k$ (that is, it is equal to the mathematic mean of $n$ elements of the original array $a$).
     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 one integer $n$ ($3 \le n \le 2 \cdot 10^5$) — the number of elements in the array.
     34 
     35 The second line contains a sequence of integers $a_1, a_2, \dots, a_n$ ($0 \le a_i \le 10^{9}$), where $a_i$ is the $i$-th element of the array.
     36 
     37 The sum of $n$ over all testcases doesn't exceed $2 \cdot 10^5$.
     38 
     39 Output
     40 
     41 Print one integer — the number of pairs of positions $[i, j]$ ($i \lt j$) such that if the elements on these positions are deleted, the mathematic mean of $(n - 2)$ remaining elements is equal to $k$ (that is, it is equal to the mathematic mean of $n$ elements of the original array $a$).
     42 
     43 Example
     44 
     45 Input
     46 
     47 ```
     48 4
     49 4
     50 8 8 8 8
     51 3
     52 50 20 10
     53 5
     54 1 4 7 3 5
     55 7
     56 1 2 3 4 5 6 7
     57 ```
     58 
     59 Output
     60 
     61 ```
     62 6
     63 0
     64 2
     65 3
     66 ```
     67 
     68 Note
     69 
     70 In the first example, any pair of elements can be removed since all of them are equal.
     71 
     72 In the second example, there is no way to delete two elements so the mathematic mean doesn't change.
     73 
     74 In the third example, it is possible to delete the elements on positions $1$ and $3$, or the elements on positions $4$ and $5$.