Interstate 201 is the most bustling road in Rockport. Traffic vehicles cause a ton of obstacles to races, particularly when there are a great deal of them. The track which goes through this thruway can be partitioned into n sub-tracks. You are given an exhibit a where man-made intelligence addresses the number of traffic vehicles in the I-th sub-track. You characterize the burden of the track as ∑i=1n∑j=i+1n|ai−aj|,
Correct answer will be upvoted else downvoted.
Interstate 201 is the most bustling road in Rockport. Traffic vehicles cause a ton of obstacles to races, particularly when there are a great deal of them. The track which goes through this thruway can be partitioned into n sub-tracks. You are given an exhibit a where man-made intelligence addresses the number of traffic vehicles in the I-th sub-track. You characterize the burden of the track as ∑i=1n∑j=i+1n|
You can play out the accompanying activity any (perhaps zero) number of times: pick a traffic vehicle and move it from its present sub-track to some other sub track.
Track down the base bother you can accomplish.
Input :The main line of input contains a solitary integer t (1≤t≤10000) — the number of experiments. The main line of each experiment contains a solitary integer n (1≤n≤2⋅105). The second line of each experiment contains n integers a1,a2,… ,an (0≤ai≤109). It is ensured that the amount of n over all experiments doesn't surpass 2⋅105.
Output :For each experiment, print a solitary line containing a solitary integer: the base bother you can accomplish by applying the given activity any (conceivably zero) number of times.
Step by step
Solved in 4 steps with 1 images
