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.
AC in 3rd attempt , % does the trick!!!!
Aren't you supposed to give constraints for a question which you have meant to be solved by modular arithmetic?
The key is that:
no need to take 10^9+7 modulo
many people have said this in the previous comments but i would like to remind the java people that pls use BigInteger to store the sum of the total candies as the main trick is handling very large sums .
Long Long int and modulo both are required!!!
why doesn't sum % 1000000007 work?
if you're coding in C++ use long long int otherwise WA
got ac on 1st attempt just use cumulative-sum and doing mod on every step
use this property of modulo --> (A + B) mod C = (A mod C + B mod C)mod C