New update is available. Click here to update.

Solve problems & track your progress

Checkout your overall progress in every topic here

Become

Sensei

in DSA topics

Open the topic and solve more problems associated with it to improve your skills

Check out the skill meter for every topic

See how many problems you are left with to solve for cracking any stage. Score more than zero to get your progress counted.

Problem

Submissions

Naughty Luke

Contributed by

Kamal Pathak

Easy

0/40

Avg time to solve 15 mins

Success Rate 70 %

5 upvotes

Problem Statement

Luke, a naughty kid, went to a museum one day. He sees an ancient grid 'A' consisting of 'N' rows and 'N' columns. Each cell of a grid is coloured with either black or white.

Luke performs two sequential operations on the grid ‘A’. First, he twists the grid vertically around the center. After that, as the second operation, he changes the colours of all the cells. If the cell is white, it is changed to black and vice-versa.

The following drawings show the twist operation and the colour change operation, respectively :

The black colour is represented by '1' and white colour is represented by '0' here. You have to print the final grid.

Example :

'N' = 2, 'A' = { {0, 1}, {0, 0} }.

After twisting, the grid looks like :
'A' =  { {1, 0}, {0, 0} }.

After changing the colours, the grid looks like :
'A' =  { {0, 1}, {1, 1} }.

Detailed explanation ( Input/output format, Notes, Constraints, Images )

Input Format :

The first line contains an integer 'T', which denotes the number of test cases to be run. Then the test cases follow.

The first line of each test case contains an integer 'N' denoting the dimension of the grid.

The next 'N' lines contain 'N' space-separated integers denoting the colour of a cell.

Output format :

For each test case, print 'N' lines containing 'N' space-separated integers denoting the colour of each cell of the final grid.

Print the output of each test case in a new line.

Note :

You don’t need to print anything. It has already been taken care of. Just implement the given function.

Constraints :

1 <= T <= 10
1 <= N <= 100.

Sum of 'N' ^ 2 over all the test cases is <= 10 ^ 4.

Time Limit: 1 sec

Sample Input 1 :

Sample Output 1 :

Explanation Of Sample Input 1 :

For test 1:
After twisting the grid looks like : { {0, 1, 1}, {1, 1, 0}, {0, 0, 1} }.
After changing the colour of cells the grid looks like : { {1, 0, 0}, {0, 0, 1}, {1, 1, 0} }.

For test 2:
After twisting the grid looks like : { {0} }.
After changing the colour of cells the grid looks like : { {1} }.

Sample Input 2 :

Sample Output 2 :

Auto

Console