F.A.Q
Hand In Hand
Online Acmers
Problem Archive
Realtime Judge Status
Authors Ranklist
 
     C/C++/Java Exams     
ACM Steps
Go to Job
Contest LiveCast
ICPC@China
Best Coder beta
VIP | STD Contests
    DIY | Web-DIY beta
Author ID 
Password 
 Register new ID

Just do it

Time Limit: 5000/2500 MS (Java/Others)    Memory Limit: 524288/524288 K (Java/Others)
Total Submission(s): 1983    Accepted Submission(s): 1068


Problem Description
There is a nonnegative integer sequence $a_{1...n}$ of length $n$. HazelFan wants to do a type of transformation called prefix-XOR, which means $a_{1...n}$ changes into $b_{1...n}$, where $b_i$ equals to the XOR value of $a_1,...,a_i$. He will repeat it for $m$ times, please tell him the final sequence.
 

Input
The first line contains a positive integer $T(1\leq T\leq5)$, denoting the number of test cases.
For each test case:
The first line contains two positive integers $n,m(1\leq n\leq2\times10^5,1\leq m\leq10^9)$.
The second line contains $n$ nonnegative integers $a_{1...n}(0\leq a_i\leq2^{30}-1)$.
 

Output
For each test case:
A single line contains $n$ nonnegative integers, denoting the final sequence.
 

Sample Input
2 1 1 1 3 3 1 2 3
 

Sample Output
1 1 3 1
 

Source
 

Statistic | Submit | Discuss | Note
Hangzhou Dianzi University Online Judge 3.0
Copyright © 2005-2024 HDU ACM Team. All Rights Reserved.
Designer & Developer : Wang Rongtao LinLe GaoJie GanLu
Total 0.000000(s) query 1, Server time : 2024-05-08 07:40:52, Gzip enabled