| Time Limit | $1$ 秒/Second(s) | Memory Limit | $512$ 兆字节/Megabyte(s) |
| 提交总数 | $1$ | 正确数量 | $1$ | "
| 裁判形式 | 标准裁判/Standard Judge | 我的状态 | 尚未尝试 |
| 难度 | 分类标签 |
Given a set of sticks of various lengths, is it possible to join them end-to-end to form a square?
The first line of input contains N, the number of test cases. Each test case begins with an integer 4 <= M <= 20, the number of sticks. M integers follow; each gives the length of a stick - an integer between 1 and 10,000.
For each case, output a line containing "yes" if is is possible to form a square; otherwise output "no".
3
4 1 1 1 1
5 10 20 30 40 50
8 1 7 2 6 4 4 3 5
yes
no
yes
| 本题记录 | 用 户（点击查看用户） | 运行号（点击购买题解） | 时 间 |
|---|---|---|---|
| 算法最快[$440 $ms] | AOJ大管家 | 84420 | 2017-04-27 15:28:56 |
| 内存最少[$33716 $KB] | AOJ大管家 | 84420 | 2017-04-27 15:28:56 |
| 第一AC | AOJ大管家 | 84420 | 2017-04-27 15:28:56 |
| 第一挑战 | AOJ大管家 | 84420 | 2017-04-27 15:28:56 |
| 竞赛编号 | 竞赛名称 | 竞赛时间 | 访问比赛 |
|---|