1516B.md (1574B)
1 Source: https://codeforces.com/problemset/problem/1516/B 2 3 B. AGAGA XOOORRR 4 5 time limit per test 6 7 1 second 8 9 memory limit per test 10 11 256 megabytes 12 13 input 14 15 standard input 16 17 output 18 19 standard output 20 21 Baby Ehab is known for his love for a certain operation. He has an array $a$ of length $n$, and he decided to keep doing the following operation on it: 22 23 * he picks $2$ adjacent elements; he then removes them and places a single integer in their place: their [bitwise XOR](https://en.wikipedia.org/wiki/Bitwise_operation#XOR). Note that the length of the array decreases by one. 24 25 Now he asks you if he can make all elements of the array equal. Since babies like to make your life harder, he requires that you leave at least $2$ elements remaining. 26 27 Input 28 29 The first line contains an integer $t$ ($1 \le t \le 15$) — the number of test cases you need to solve. 30 31 The first line of each test case contains an integers $n$ ($2 \le n \le 2000$) — the number of elements in the array $a$. 32 33 The second line contains $n$ space-separated integers $a_1$, $a_2$, $\ldots$, $a_{n}$ ($0 \le a_i \lt 2^{30}$) — the elements of the array $a$. 34 35 Output 36 37 If Baby Ehab can make all elements equal while leaving at least $2$ elements standing, print "YES". Otherwise, print "NO". 38 39 Example 40 41 Input 42 43 ``` 44 2 45 3 46 0 2 2 47 4 48 2 3 1 10 49 ``` 50 51 Output 52 53 ``` 54 YES 55 NO 56 ``` 57 58 Note 59 60 In the first sample, he can remove the first $2$ elements, $0$ and $2$, and replace them by $0 \oplus 2=2$. The array will be $[2,2]$, so all the elements are equal. 61 62 In the second sample, there's no way to make all the elements equal.