Associated Course(s):
Fork Java

*Bitwise operations help us in a lot of problems. We can find the non-repeating element in an array, find number of set-bits, do division, find subsets and so on. Indeed, we can see that learning to cleverly use bitwise operations is vital to any programmer.*

You are given an array** A of size N**. You need to do the following:

- You need to
**xor**the elements of the arrays with their**respective indices**(index starting from 0). - After step1,
**print the array.** - Now,
**set all the elements of A to zero**. - Now,
**print A.**

**Input Format:**

The first line contains **T**, the number of testcases. T testcases follow. Each testcase contains two lines of input. The first line contains N, the size of the array. The second line contains the elements of the array.

**Output Format:**

For each testcase, in a new line, print the **output**.

**Your Task:**

Since this is a function problem, you don't need to take any input. Just complete the provided functions.

**Constraints:**

1 <= T <= 100

1 <= N <= 1000

1 <= A_{i} <= 1000

**Example:**

**Input:**

1

10

1 2 3 4 5 6 7 8 9 10

**Output:**

1 3 1 7 1 3 1 15 1 3

0 0 0 0 0 0 0 0 0 0

**Explanation:
Testcase1:**

First we take xor of every element with their indices, like 1xor0, 2xor1, 3xor2, 4xor3 and so on.

Now print the resultant array

Now set all the elements of array to zero

Now print the resultant array

If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.

vamsikrishna55 | 162 |

Vagesh Verma | 158 |

UrGuru | 133 |

abducodes | 127 |

Akhil varma | 114 |

abducodes | 683 |

harshtyagi36 | 322 |

Akhil varma | 267 |

arpit_anshuman | 258 |

highway_to_hell | 252 |

blackshadows | 5331 |

Ibrahim Nash | 5219 |

akhayrutdinov | 5111 |

mb1973 | 4929 |

Quandray | 4567 |

Login to report an issue on this page.