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.
no constraints given very poor explanation
how to read input?
taking modulo is key for AC ! easy one...comments helped
How to get rid of NZEC runtime error. Solution executes on ideone but I am getting this error after uploading
listen comments are just mis leading just keep it simple % when sum>no of inputs and don't forget to set sum to 0 again this cost me 2 wrong answer
C++ people Use unsigned long long int .
AC with python
Replaced cin and cout with scanf and prinf and finally it worked!!!(AC)
AC in one go (which for me is a rare accomplishment)! I never quite wrapped my head around modular arithmetic before this problem, but the simple implementation helped clarify the fundamental concepts immensely. Now to go solve several of the large I/O programs that previously stumped me! (I must agree, however, that not knowing the constraints of a problem can waste a lot of time and energy.)Last edit: 2016-06-20 02:34:18
Long long int won't work, you need more. Cause sum is larger than google(>100 digits)