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.





Note: the input file will not exceed 1MB.

hide comments
the_art_maniac: 2021-05-18 13:26:13

The concept is easy they are only trying you to trick by using large numbers in the test case so mind that , hint :- modulo properties can be used

harini_18: 2021-05-08 20:59:23

for the ones working with C lang declare the variables as long long int. hope it helps!!!

dileep_32: 2021-03-03 18:21:08

(a + b) % m = ((a % m) + (b % m)) % m

use this property using long data type in c++ might not help.

vishalbacha: 2021-02-12 10:24:40

Worst experience

tejasreddyk: 2021-01-10 19:22:02

AC in one go!

saikumarpatel: 2021-01-07 15:21:06

whats mistake

[NG]: Read my response to you in COINS. If you keep posting code in comments, you may find your privilege of commenting turned off.

Last edit: 2021-01-07 23:01:08
hnooona: 2021-01-06 02:25:58

this is harmful to the website itself, think about all extra useless memory of code the website stores in the servers because of subtle bugs from omitting the constraints

saurabh_shinde: 2020-08-13 19:22:52

Keep taking mod when you add each term to sum.. AC in one go.. fyyy...!!

kishor_e: 2020-07-29 19:41:04

don't worry about the blank space, wasted an hour for it :(

sanjay18r: 2020-07-25 20:16:41

Just use long long int for taking test cases with modulo.

Last edit: 2020-07-25 20:17:34

Added by:Fudan University Problem Setters
Time limit:1s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All except: C99 ERL JS-RHINO
Resource:IPSC 2006