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
|
Priyansh Saxena:
2015-02-10 07:59:00
How do I get rid of NZEC with Python 3.4.
|
|
Dinesh:
2015-02-09 17:12:59
i think its large input! so careful on that |
|
Abhishek Naik:
2015-02-08 05:43:30
I understood that we need to use long long int after reading the comments. How could I have understood this without reading the comments? I prefer not to read them. Is there any clue in the problem that mentions this? |
|
Mercury:
2015-02-02 11:27:51
Good question to remember modulusr. Last edit: 2015-02-02 11:28:04 |
|
M.Srivathsan:
2015-01-28 19:07:06
finally got AC after 6 submissions
|
|
bharat:
2015-01-27 21:30:54
sum of long long input can be more than long long....good use of modulo |
|
Srikant Aggarwal:
2015-01-26 20:30:23
Well... Took hint from the comments.. Thank you guys!! |
|
Dushyant Singh:
2015-01-19 19:52:48
Got AC after 6 submissions! Note: input can be declared using long long int but it is not necessary that sum of all inputs will be long long int. It might be greater than range of long long int. So use % wisely!
|
|
Arnabjyoti Kalita:
2015-01-18 14:32:42
got it ...be careful with the usage of modulo operator... :) |
|
Arnabjyoti Kalita:
2015-01-18 14:21:50
Somebody plz say what are the constraints for input...inspite of using unsigned long long for testcases and the other inputs---it is still showing WA...????
|
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 |