Check if possible to shuffle a matrix with adjacent movements
Given a N x M matrix which represents the number of rows and number of columns respectively. Each cell of a matrix is occupied by exactly one student. The task is to determine whether we can shuffle each student in such a way that each student should occupy a cell that is adjacent to that student’s original cell, i.e. immediately to the left, right, top or bottom of that cell and after shuffling each cell should occupy by exactly one student.
Input: N = 3, M = 3
Output: Shuffling not possible
Input: N = 4, M = 4
Output: Shuffing is possible
One possible way to shuffle the student is as shown below:
Approach: Check if the number of rows or the number of columns is even then shuffling is possible otherwise no shuffling is possible.
Below is the implementation of the above approach:
// Java implementation of above approach
// Function that will check whether
// Shuffling is possible or not
static void Shuffling(int N, int M)
if (N % 2 == 0 || M % 2 == 0)
System.out.println("Shuffling is possible");
System.out.println("Shuffling not possible");
// Driver code
public static void main (String args)
int N = 4, M = 5;
// Calling function.
// This code is contributed by anuj_67..
Shuffling is possible