문제2479--Square

2479: Square

실행시간 제한: 3 Sec  메모리사용 제한: 64 MB
제출: 10  통과: 1
[제출] [채점기록] [묻고답하기]

문제 설명

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".

입력 예시 Copy

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

출력 예시 Copy

yes
no
yes

출처/분류