Another Candies
来源:互联网 发布:网络运行 编辑:程序博客网 时间:2024/05/21 20:28
Description
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.)
Input
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
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.
Sample Input
255273867112734
Sample Output
YESNO
0 0
- Another Candies
- Candies
- Candies
- another
- ANother
- another
- Candies(HackerRank candies)
- InterviewStreet --Candies
- poj3159 Candies
- zoj Candies
- ZOJ Candies
- poj3159 Candies
- Free Candies
- Hackerrank :Candies
- poj3159 Candies
- 【poj3159】 Candies
- [POJ3159]candies
- Dogs' Candies
- compiz在debian上的安装和使用
- 国标舞简介
- 机制的少年呀
- 四十六 枚举类型 --- 一般不用。麻烦
- sort对第三个参数的使用
- Another Candies
- Preference实现自定义视图
- TLD tracking learning detection 学习资料
- 第四章 连接
- TrustZone——开发环境—FastModels-WIN平台
- 超实用的javascript技巧及实践(上)
- 大型网站架构一步步构建
- Linux那些事儿之我是SCSI硬盘(4)三座大山(一)
- Makefile实例分析注