A15244 | $The Third Three Number Problem$

时间限制1s

内存限制256MB

通过 / 提交0/0

题目描述

You are given a positive integer $n$ . Your task is to find any three integers $a$ , $b$ and $c$ ( $0 \le a, b, c \le 10^9$ ) for which $(a\oplus b)+(b\oplus c)+(a\oplus c)=n$ , or determine that there are no such integers. Here $a \oplus b$ denotes the [bitwise XOR](https://en.wikipedia.org/wiki/Bitwise_operation#XOR) of $a$ and $b$ . For example, $2 \oplus 4 = 6$ and $3 \oplus 1=2$ .

Each test contains multiple test cases. The first line contains a single integer $t$ ( $1 \le t \le 10^4$ ) — the number of test cases. The following lines contain the descriptions of the test cases. The only line of each test case contains a single integer $n$ ( $1 \le n \le 10^9$ ).

For each test case, print any three integers $a$ , $b$ and $c$ ( $0 \le a, b, c \le 10^9$ ) for which $(a\oplus b)+(b\oplus c)+(a\oplus c)=n$ . If no such integers exist, print $-1$ .

输入 #1

输出 #1

3 3 1
-1
2 4 6
69 420 666
12345678 87654321 100000000

C++ 编辑器

输入

输出