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
NO
Note: the input file will not exceed 1MB.

hide comments
apoorv1412: 2018-06-13 19:08:40

Last edit: 2018-06-14 18:23:57
deepak4669: 2018-06-05 12:33:15

In java do not use int for number of candies/student

vivek_dwivedi: 2018-06-05 08:52:44

easy as hell!

pjha573: 2018-05-27 20:43:40

use "%" for every input instead of adding them

jmr99: 2018-03-11 11:14:24

just do sum nd divide by n is eq n then yes or no !!

rahulsangwn: 2018-01-25 11:29:19

in python use raw_input for blanks along with modular arithmetic

sachin_0: 2018-01-22 13:32:58

size long long int for every variable and while summation use modolus as well
my problem accepted really

sanyam19: 2018-01-06 11:05:42

My 80th..... :)
easy 1... since range not gvn... solve using "%"

ravi_chandra: 2017-12-31 16:58:24

long long and modulo division!!!!!!

hitesh87: 2017-09-23 09:15:36

input is very large used boost lib with c++.


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