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.

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

hide comments
2015-12-19 17:32:55
using unsigned long long int and also using modulus....still getting wrong answer...please help.
<snip>

Last edit: 2023-06-02 23:40:07
2015-12-13 21:13:28
Take everything (i.e all variable) in Long Long int.
also do modulus after every addition.
2015-12-07 14:47:54
what is nzec run time error
2015-11-11 09:17:25
why am i getting tle, when i just use sum and divide to check ?
2015-10-23 10:45:59
for the people saying % doesn't work .. % operator requires both the operands to be of int type. but here the total or the sum can be bigger than int therefore use the fmod function.
2015-10-23 10:44:14
What is the problem with my code ?? <snip>

Edit : Got AC. The problem is easy and requires a little bit of off beat thinking.

Last edit: 2023-06-02 23:40:16
2015-10-22 15:54:29
Use big integer in java, the author didnt specify input constraints
2015-10-20 17:43:47 dragonemperor
Problem setters please mention input constraints properly
2015-10-19 01:54:47
It's one from the easiest problems from spoj, but I learned much.....I got 2 WA due to the size of sum....To pass safely, you have to use modulo in every input: read a; sum+=a; sum%=a.....
2015-10-17 14:02:51
3 WA's and finally an AC. Nice problem, just be careful about overflow here. :)
© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.