CANDY3  Candy III
A class went to a school trip. And, as usually, all N kids have got their backpacks stuffed with candy. But soon quarrels started all over the place, as some of the kids had more candies than others. Soon, the teacher realized that he has to step in: "Everybody, listen! Put all the candies you have on this table here!"
Soon, there was quite a large heap of candies on the teacher's table. "Now, I will divide the candies into N equal heaps and everyone will get one of them." announced the teacher.
"Wait, is this really possible?" wondered some of the smarter kids.
Problem specification
You are given the number of candies each child brought. Find out whether the teacher can divide the candies into N exactly equal heaps. (For the purpose of this task, all candies are of the same type.)
Input specification
The first line of the input file contains an integer T specifying the number of test cases. Each test case is preceded by a blank line.
Each test case looks as follows: The first line contains N : the number of children. Each of the next N lines contains the number of candies one child brought.
Output specification
For each of the test cases output a single line with a single word "YES" if the candies can be distributed equally, or "NO" otherwise.
Example
Input: 2 5 5 2 7 3 8 6 7 11 2 7 3 4 Output: YES NONote: the input file will not exceed 1MB.
hide comments
blueranger:
20160602 19:53:49
C++ programmers use unsigned long long ... R = (I+R)%N Last edit: 20160602 19:54:27 

supertramp_sid:
20160523 10:28:14
Very nice question. taught an interesting way to use modulo operator 

jaisawlani:
20160330 16:48:31
Don't try to try in java 

mickey_v:
20160325 19:06:11
(A + B) mod C = (A mod C + B mod C) mod C 

zacle:
20160317 20:01:07
For java programmer use sum+=a[i]%total number of candles to avoid overflow 

Ankit:
20160222 17:56:45
My 26th at SPOJ. :) 

suman_biswas95:
20160207 18:20:27
don't need to take long long int.....


suman_biswas95:
20160207 18:19:45
take correct % in loop 

sharath_111:
20160126 14:33:40
comments helped,AC in one go..use long long and modulo for sum..my 15 th in SPOJ :)


tni_mdixit:
20160118 22:42:45
took all in unsigned long long int,coming the right one on my pc,still wrong answer ....plz help

Added by:  Fudan University Problem Setters 
Date:  20071201 
Time limit:  1s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: C99 ERL JSRHINO 
Resource:  IPSC 2006 