Monocarp has an exhibit a comprising of n integers. We should indicate k as the mathematic mean of these components (note that it's conceivable that k isn't an integer). The mathematic mean of a variety of n components is the amount of components partitioned by the number of these components (i. e. total isolated by n).
Correct details answer will upvoted else downvoted .
Monocarp has an exhibit a comprising of n integers. We should indicate k as the mathematic mean of these components (note that it's conceivable that k isn't an integer). The mathematic mean of a variety of n components is the amount of components partitioned by the number of these components (i. e. total isolated by n).
Monocarp needs to erase precisely two components from a so that the mathematic mean of the excess (n−2) components is as yet equivalent to k. Your errand is to ascertain the number of sets of positions [i,j] (i<j) with the end goal that if the components on these positions are erased, the mathematic mean of (n−2) remaining components is equivalent to k (that is, it is equivalent to the mathematic mean of n components of the first cluster a).
Input : The main line contains a solitary integer t (1≤t≤104) — the number of testcases. The principal line of each testcase contains one integer n (3≤n≤2⋅105) — the number of components in the exhibit. The subsequent line contains an arrangement of integers a1,a2,… ,an (0≤
Output : Print one integer — the number of sets of positions [i,j] (i<j) with the end goal that if the components on these positions are erased, the mathematic mean of (n−2) remaining components is equivalent to k (that is, it is equivalent to the mathematic mean of n components of the first cluster a).
Step by step
Solved in 3 steps with 1 images
