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
ayushagg31:
20170122 11:15:22
No need to focus on next line after input.....just focus on candies output and use modulo function


akashranjan28:
20161210 09:26:33
very easy problem ...main trick is to store very big number 

kira28:
20161130 18:30:29
chutiyaap... 

atkr323:
20161125 03:16:28
Basically Im a die hard naruto fan , that show is my life <3


saand_nitd:
20161019 09:29:33
use modulo property !!! 

angel_of_death:
20161016 18:32:54
The logic is very simple. The real hidden challenge in this problem is that the sum can be very huge. The constraints should be mentioned in the problem statement if the author doesn't want people to waste their time thinking their logic was flawed. 

Filip Sollar:
20161014 03:07:07
easy problem for c++sers read single child candies with long long unsigned and use simple logic. Nice problem for complete beginners. AC in one go 

sonudoo:
20161009 19:36:25
Very tricky. Thanks narutohokage_1 for the inspiration 

prashant2018:
20160909 17:00:04
Use getchar() in c++ to detect blank line. Last edit: 20160909 17:00:23 

shaan001:
20160905 08:28:41
Why do we get NZEC in java...?? 
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 