A15304 | $Even-Odd XOR$

时间限制1s

内存限制256MB

通过 / 提交0/0

题目描述

Given an integer $n$ , find any array $a$ of $n$ distinct nonnegative integers less than $2^{31}$ such that the [bitwise XOR](https://en.wikipedia.org/wiki/Bitwise_operation#XOR) of the elements on odd indices equals the bitwise XOR of the elements on even indices.

The first line of the input contains an integer $t$ ( $1 \leq t \leq 629$ ) — the number of test cases. Then $t$ lines follow, each containing a single integer $n$ $(3 \leq n \leq 2\cdot10^5)$ — the length of the array. It is guaranteed that the sum of $n$ over all test cases does not exceed $2\cdot 10^5$ .

For each test case, output one line containing $n$ distinct integers that satisfy the conditions. If there are multiple answers, you can output any of them.

输入 #1

输出 #1

4 2 1 5 0 6 7 3
2 1 3
2 1 3 0
2 0 4 5 3
4 1 2 12 3 8
1 2 3 4 5 6 7
8 2 3 7 4 0 5 6 9

C++ 编辑器

输入

输出