MKEQUAL  Make them equal !
You have an array containing N elements. At any move, you choose two indices i and j ( 0 <= i, j < N and i != j ) and increment value at one index and decrement value at other index. You can make this move any number of times. What is the maximum number of elements which can have the same value (after any number of moves) ?
Input
First line consists of T, the number of test cases. (1 <= T <= 100)
T sets follow. Each set contains N, the number of elements in the array, in the first line. (1 <= N <= 100000)
Next line of each set consists of N space separated integers (0 <= value <= 100000)
Output
Output T lines each containing the required answer.
Example
Input: 1 4 1 2 3 4 Output: 3
hide comments
vaibhav18_:
20190621 11:10:20
just open the spoj toolkit try different cases even if u dont see the question u can do the answer 

ankkt16:
20190129 05:39:31
what to print in the case when none of the elements could be made to same no


malcolm123_ssj:
20190125 07:48:13
consider only 2 cases: when sum is divisible by n and when not divisible by n


wrzoboo:
20180605 18:10:57
Really easy one, there are only two options to consider. (Hint: think with zeroes ;) ) 

sinersnvrsleep:
20180405 15:35:05
no need of binary search just simple adhoc


ameyanator:
20180327 15:37:06
At first I thought we'd have to use some pre defined property but then nah just read the question carefully 

nikhil2504:
20170730 15:59:30
Only Pen and Paper can help you !


ankit1cool:
20170606 08:49:00
Good Implementation of binary search 

be1048716:
20170519 20:17:53
No getting the question. Can anybody plz explain me the output?


ashishranjan28:
20170518 07:02:10
very easy 
Added by:  Pandian 
Date:  20131015 
Time limit:  0.5s1s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ASM64 
Resource:  Own 