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
kira28: 2016-11-30 18:30:29

chutiyaap...

atkr323: 2016-11-25 03:16:28

Basically Im a die hard naruto fan , that show is my life <3
@Narutohokage you are such an inspiration !

saand_nitd: 2016-10-19 09:29:33

use modulo property !!!

angel_of_death: 2016-10-16 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: 2016-10-14 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: 2016-10-09 19:36:25

Very tricky. Thanks narutohokage_1 for the inspiration

prashant2018: 2016-09-09 17:00:04

Use getchar() in c++ to detect blank line.

Last edit: 2016-09-09 17:00:23
shaan001: 2016-09-05 08:28:41

Why do we get NZEC in java...??

karankiri: 2016-09-02 14:05:41

how to detect blank line in cpp ??

narutohokage_1: 2016-09-01 02:54:27

Got Many Many Wrong Answers :

My 2 Cents :

1 . Dont use float or such thing because they always mess up .Because they are not perfect.
2. Try to use a method in which you use integer only.
3. Single Child Can Have Candy That comes in long long int range . I tried long int but failed as soon as i tried long long int code accepted.
4.Try to think on your own . Do not look in comments for method.And also no tip on method.
5.Problem is really simple , the idea is really really simple all these comment will make it look like a tough problem, follow your instinct it is easy problem.
6. Use correct format specifiers .Cost me many many WA around 7.
8. Format Specifier For long long int is %lld.
9.Dont worry about rank drop when so many WA .
10. Nobody will look at rank but at your potential . So do all experiment you want to do.


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