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
|
itsdennian:
2014-12-08 09:04:44
First tried in C#, got a lot of NZECs. Did it in C. AC in first go.
|
|
JC:
2014-12-05 16:44:46
If you remove overflowing from this problem there is nothing left. |
|
Sarthak Munshi:
2014-11-18 07:26:06
Question implies 2 ways of doing it. one of them shows WA . |
|
ravi gupta:
2014-11-10 11:06:51
@abhishek jaiswal
|
|
albert einstein :
2014-11-08 11:23:55
WA in spoj but working on ideone
|
|
sitaram:
2014-11-06 14:06:26
showing wrong ans,,,,,working in compiler
|
|
jinkies:
2014-10-21 18:40:58
pretty easy problem, just note that % is a pretty expensive operation :$ |
|
saumya:
2014-10-18 06:31:34
:P :P ... Extremely silly mistake caused me 2 WA!! Dotn forgrt to initialise sum to 0 after each case ;) |
|
Ashish Bahl:
2014-10-09 23:10:34
showing wrong answer but works fine on compiler |
|
ssk:
2014-09-29 21:04:37
modulo helps u.... :)
|
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 |