Given an integer $n$ , find any array $a$ of $n$ distinct nonnegative integers less than $2^{31}$ such that the bitwise XOR of the elements on odd indices equals the bitwise XOR of the elements on even indices.
A bitwise XOR is a binary operation that takes two bit patterns of equal length and performs the logical exclusive OR operation on each pair of corresponding bits. The result in each position is $1$ if only one of the bits is $1$, but will be $0$ if both are $0$ or both are $1$. In this we perform the comparison of two bits, being $1$ if the two bits are different, and $0$ if they are the same.
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 \cdot 10^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.
7 8 3 4 5 6 7 9
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
不公開 測資點#0 (10%): 1.0s , <1M
不公開 測資點#1 (10%): 1.0s , <1M
不公開 測資點#2 (10%): 1.0s , <1M
不公開 測資點#3 (10%): 1.0s , <1M
不公開 測資點#4 (10%): 1.0s , <1M
不公開 測資點#5 (10%): 1.0s , <1K
不公開 測資點#6 (10%): 1.0s , <1K
不公開 測資點#7 (10%): 1.0s , <1K
不公開 測資點#8 (10%): 1.0s , <1K
不公開 測資點#9 (10%): 1.0s , <1K
| ID | User | Problem | Subject | Hit | Post Date |
沒有發現任何「解題報告」 |
|||||