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.
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.)
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.
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.
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.
Basically Im a die hard naruto fan , that show is my life <3
use modulo property !!!
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.
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
Very tricky. Thanks narutohokage_1 for the inspiration
Use getchar() in c++ to detect blank line.Last edit: 2016-09-09 17:00:23
Why do we get NZEC in java...??
how to detect blank line in cpp ??
Got Many Many Wrong Answers :