P r o b l e m S t a t e m e n t \color{blue}Problem Statement ProblemStatement
There are N N N Snuke Cats numbered 1 , 2 , … , N 1,2,…,N 1,2,…,N, where N N N is even.
Each Snuke Cat wears a red scarf, on which his favorite non-negative integer is written.
Recently, they learned the operation called xor (exclusive OR).
We know that the xor calculated by Snuke Cat i, that is, the xor of the integers written on the scarfs except the scarf of Snuke Cat i is ai
. Using this information, restore the integer written on the scarf of each Snuke Cat.
C o n s t r a i n t s \color{blue}Constraints Constraints
All values in input are integers. 2 ≤ N ≤ 200000 2≤N≤200000 2≤N≤200000, N N N is even. 0 ≤ a i ≤ 1 0 9 0≤a_i≤10^9 0≤ai≤109
There exists a combination of integers on the scarfs that is consistent with the given information.
I n p u t \color{blue}Input Input
Input is given from Standard Input in the following format:
N
a1
a2
…
aN
O u t p u t \color{blue}Output Output
Print a line containing
最低0.47元/天 解锁文章
264
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
