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
tejasreddyk:
20210110 19:22:02
AC in one go! 

saikumarpatel:
20210107 15:21:06
<snip>


hnooona:
20210106 02:25:58
this is harmful to the website itself, think about all extra useless memory of code the website stores in the servers because of subtle bugs from omitting the constraints 

saurabh_shinde:
20200813 19:22:52
Keep taking mod when you add each term to sum.. AC in one go.. fyyy...!! 

kishor_e:
20200729 19:41:04
don't worry about the blank space, wasted an hour for it :( 

sanjay18r:
20200725 20:16:41
Just use long long int for taking test cases with modulo. Last edit: 20200725 20:17:34 

mm21:
20200716 20:01:43
Input format is the worst. We have to consider the new line after every set of test cases too. Took me 2 NZEC to figure that out. 

jhj8088:
20200613 13:50:54
fuck this website 

adikrmishra_1:
20200519 20:12:46
simple question use modular arithmetics :) 

avi_kumar15:
20200519 07:56:09
oof, atleast give constraints

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 