CF1270C.Make Good
普及/提高-
通过率:0%
AC君温馨提醒
该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。
题目描述
Let's call an array a1,a2,…,am of nonnegative integer numbers good if a1+a2+⋯+am=2⋅(a1⊕a2⊕⋯⊕am) , where ⊕ denotes the bitwise XOR operation.
For example, array [1,2,3,6] is good, as 1+2+3+6=12=2⋅6=2⋅(1⊕2⊕3⊕6) . At the same time, array [1,2,1,3] isn't good, as 1+2+1+3=7=2⋅1=2⋅(1⊕2⊕1⊕3) .
You are given an array of length n : a1,a2,…,an . Append at most 3 elements to it to make it good. Appended elements don't have to be different. It can be shown that the solution always exists under the given constraints. If there are different solutions, you are allowed to output any of them. Note that you don't have to minimize the number of added elements!. So, if an array is good already you are allowed to not append elements.
输入格式
Each test contains multiple test cases. The first line contains the number of test cases t ( 1≤t≤10000 ). The description of the test cases follows.
The first line of each test case contains a single integer n (1≤n≤105) — the size of the array.
The second line of each test case contains n integers a1,a2,…,an ( 0≤ai≤109 ) — the elements of the array.
It is guaranteed that the sum of n over all test cases does not exceed 105 .
输出格式
For each test case, output two lines.
In the first line, output a single integer s ( 0≤s≤3 ) — the number of elements you want to append.
In the second line, output s integers b1,…,bs ( 0≤bi≤1018 ) — the elements you want to append to the array.
If there are different solutions, you are allowed to output any of them.
输入输出样例
输入#1
3 4 1 2 3 6 1 8 2 1 1
输出#1
0 2 4 4 3 2 6 2
说明/提示
In the first test case of the example, the sum of all numbers is 12 , and their ⊕ is 6 , so the condition is already satisfied.
In the second test case of the example, after adding 4,4 , the array becomes [8,4,4] . The sum of numbers in it is 16 , ⊕ of numbers in it is 8 .