A14411 | $Array Differentiation$

时间限制1s

内存限制256MB

通过 / 提交0/0

题目描述

You are given a sequence of $n$ integers $a_1, \, a_2, \, \dots, \, a_n$ . Does there exist a sequence of $n$ integers $b_1, \, b_2, \, \dots, \, b_n$ such that the following property holds? - For each $1 \le i \le n$ , there exist two (not necessarily distinct) indices $j$ and $k$ ( $1 \le j, \, k \le n$ ) such that $a_i = b_j - b_k$ .

The first line contains a single integer $t$ ( $1 \le t \le 20$ ) — the number of test cases. Then $t$ test cases follow. The first line of each test case contains one integer $n$ ( $1 \le n \le 10$ ). The second line of each test case contains the $n$ integers $a_1, \, \dots, \, a_n$ ( $-10^5 \le a_i \le 10^5$ ).

For each test case, output a line containing YES if a sequence $b_1, \, \dots, \, b_n$ satisfying the required property exists, and NO otherwise.

输入 #1

5
5
4 -7 -1 5 10
1
0
3
1 10 100
4
-3 2 10 2
9
25 -171 250 174 152 242 100 -205 -258

输出 #1

YES
YES
NO
YES
YES

C++ 编辑器

输入

输出