同和创作矩阵 › ›博文归档› 技术博文归档 › 查看内容

22357_Square

2022-5-16 18:21| 发布者: Hocassian| 查看: 18| 评论: 0|原作者: 肇庆学院ACM合集

摘要:

C:\Users\Administrator\Downloads\2019-10-12-10-14-5-89506352017400-Problem List-采集的数据-后羿采集器.html

Pro.ID

22357

Title

Square

Title链接

http://10.20.2.8/oj/exercise/problem?problem_id=22357

AC

Submit

169

Ratio

32.54%

时间&空间限制

Time Limit: 800/400 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)

描述

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.

输出

Description

Given a set of sticks of various lengths, is it possible to join them end-to-end to form a square?

Input

Output

For each case, output a line containing "yes" if is is possible to form a square; otherwise output "no".

Sample Input

3
4 1 1 1 1
5 10 20 30 40 50
8 1 7 2 6 4 4 3 5

Sample Output

yes
no
yes

Source

Waterloo local contest 2002

样例输入