Loading...

Leaderboard
Showing:
Handle Score
@Ibrahim Nash 5761
@blackshadows 5715
@akhayrutdinov 5111
@mb1973 4989
@Quandray 4944
@saiujwal13083 4506
@sanjay05 3762
@marius_valentin_dragoi 3516
@sushant_a 3459
@verma_ji 3341
@KshamaGupta 3318
Complete Leaderboard
Xoring and Clearing - Java
Easy Accuracy: 68.7% Submissions: 2821 Points: 2

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:

1. You need to xor the elements of the arrays with their respective indices(index starting from 0).
2. After step1, print the array.
3. Now, set all the elements of A to zero.
4. 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 <= Ai <= 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

to report an issue on this page.

Editorial

We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?

My Submissions:

Login to access your submissions.

Xoring and Clearing - Java