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
Dilpreet: 2016-07-01 11:21:43

C++ people Use unsigned long long int .
int will give you WA.

Anushka: 2016-06-29 20:27:15

AC with python

baadshah_: 2016-06-21 09:32:27

Replaced cin and cout with scanf and prinf and finally it worked!!!(AC)

comp0zr: 2016-06-20 02:32:02

AC in one go (which for me is a rare accomplishment)! I never quite wrapped my head around modular arithmetic before this problem, but the simple implementation helped clarify the fundamental concepts immensely. Now to go solve several of the large I/O programs that previously stumped me! (I must agree, however, that not knowing the constraints of a problem can waste a lot of time and energy.)

Last edit: 2016-06-20 02:34:18
xinnix: 2016-06-17 15:45:23

Long long int won't work, you need more. Cause sum is larger than google(>100 digits)

top_gun007: 2016-06-06 09:08:44

comments could be mis-leading..lol

shady313: 2016-06-03 18:08:23

input and output constraint..??...never mind ...solved it ..

Last edit: 2016-06-04 12:32:43
blueranger: 2016-06-02 19:53:49

C++ programmers use unsigned long long ... R = (I+R)%N

Last edit: 2016-06-02 19:54:27
supertramp_sid: 2016-05-23 10:28:14

Very nice question. taught an interesting way to use modulo operator

jaisawlani: 2016-03-30 16:48:31

Don't try to try in java


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