308649: CF1552D. Array Differentiation
Memory Limit:256 MB
Time Limit:1 S
Judge Style:Text Compare
Creator:
Submit:0
Solved:0
Description
Array Differentiation
题意翻译
$ t $ 组数据,每一组给定一个数组 $ \{a_n\} $,问是否存在这样一个数组 $ \{ b_n \}$,对于所有 $ i \in [1,n] $,都存在一组 $ j、k\in[1,n] $,满足 $ a_i=b_j-b_k $。 $ 1\le t\le 20$,$ 1\le n \le 10 $,$ -10^5 \le a_i \le 10^5 $。题目描述
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