Codeforces Round 628 (Div. 2) |
---|
Finished |
Given 2 integers $$$u$$$ and $$$v$$$, find the shortest array such that bitwise-xor of its elements is $$$u$$$, and the sum of its elements is $$$v$$$.
The only line contains 2 integers $$$u$$$ and $$$v$$$ $$$(0 \le u,v \le 10^{18})$$$.
If there's no array that satisfies the condition, print "-1". Otherwise:
The first line should contain one integer, $$$n$$$, representing the length of the desired array. The next line should contain $$$n$$$ positive integers, the array itself. If there are multiple possible answers, print any.
2 4
2 3 1
1 3
3 1 1 1
8 5
-1
0 0
0
In the first sample, $$$3\oplus 1 = 2$$$ and $$$3 + 1 = 4$$$. There is no valid array of smaller length.
Notice that in the fourth sample the array is empty.
Name |
---|