Given a 3*3 matrix, find the minimum number of changes that need to be made to it in order to turn it into a magic square. A magic square is a square matrix whose sum of all the rows are the same, the sum of all the columns are the same and the sum of both the diagonals are the same.
Examples:
Input : 8 5 6
3 8 7
4 9 2
Output : 2
5 in row 1 col 2 should be changed to 1
8 in row 2 col 2 should be changed to 5
Total 2 changes are required.
Input : 8 9 4
5 9 3
6 1 8
Output : 3
8 in row 1 col 1 should be changed to 2
5 in row 2 col 1 should be changed to 7
9 in row 2 col 2 should be changed to 5
Total 3 changes are required.
There are 8 possible magic squares of 3*3 dimensions, which are 8 1 6 3 5 7 4 9 2 6 1 8 7 5 3 2 9 4 4 9 2 3 5 7 8 1 6 2 9 4 7 5 3 6 1 8 8 3 4 1 5 9 6 7 2 4 3 8 9 5 1 2 7 6 6 7 2 1 5 9 8 3 4 2 7 6 9 5 1 4 3 8
We create a 3D array to store these 8 matrices. Now we check the input matrix for each of these 8 matrices and find out the one which can be obtained with the least number of changes.
Implementation:
C++
#include <bits/stdc++.h>using namespace std;// This program takes in two 2D arrays as // input and compares them to find out the // minimum number of changes that needs to // be made to convert arr to ms. int findMinimumFromMS(int arr[][3], int ms[][3]) { int count = 0; for(int i = 0; i < 3; i++) { for(int j = 0; j < 3; j++) { if (arr[i][j] != ms[i][j]) count++; } } return count; } int findMinimum(int arr[][3]) { int ms[][3][3] = { { { 8, 1, 6 }, { 3, 5, 7 }, { 4, 9, 2 } }, { { 6, 1, 8 }, { 7, 5, 3 }, { 2, 9, 4 } }, { { 4, 9, 2 }, { 3, 5, 7 }, { 8, 1, 6 } }, { { 2, 9, 4 }, { 7, 5, 3 }, { 6, 1, 8 } }, { { 8, 3, 4 }, { 1, 5, 9 }, { 6, 7, 2 } }, { { 4, 3, 8 }, { 9, 5, 1 }, { 2, 7, 6 } }, { { 6, 7, 2 }, { 1, 5, 9 }, { 8, 3, 4 } }, { { 2, 7, 6 }, { 9, 5, 1 }, { 4, 3, 8 } }, }; // If all the elements need to be changed, // there would be 9 changes, so we take the // max as 9 int min = 9; for(int i = 0; i < 8; i++) { int x = findMinimumFromMS(arr, ms[i]); if (x < min) min = x; } return min; } // Driver code int main(){ int arr[][3] = { { 8, 5, 6 }, { 3, 8, 7 }, { 4, 9, 2 } }; cout << findMinimum(arr) << endl; return 0;}// This code is contributed by divyeshrabadiya07 |
Java
class GfG { // this program takes in two 2D arrays as // input and compares them to find out the // minimum number of changes that needs to // be made to convert arr to ms. public static int findMinimumFromMS(int[][] arr, int[][] ms) { int count = 0; for (int i = 0; i < 3; i++) { for (int j = 0; j < 3; j++) { if (arr[i][j] != ms[i][j]) count++; } } return count; } public static int findMinimum(int[][] arr) { int[][][] ms = { { { 8, 1, 6 }, { 3, 5, 7 }, { 4, 9, 2 } }, { { 6, 1, 8 }, { 7, 5, 3 }, { 2, 9, 4 } }, { { 4, 9, 2 }, { 3, 5, 7 }, { 8, 1, 6 } }, { { 2, 9, 4 }, { 7, 5, 3 }, { 6, 1, 8 } }, { { 8, 3, 4 }, { 1, 5, 9 }, { 6, 7, 2 } }, { { 4, 3, 8 }, { 9, 5, 1 }, { 2, 7, 6 } }, { { 6, 7, 2 }, { 1, 5, 9 }, { 8, 3, 4 } }, { { 2, 7, 6 }, { 9, 5, 1 }, { 4, 3, 8 } }, }; // If all the elements need to be changed, // there would be 9 changes, so we take the // max as 9 int min = 9; for (int i = 0; i < 8; i++) { int x = findMinimumFromMS(arr, ms[i]); if (x < min) min = x; } return min; } public static void main(String[] args) { int[][] arr = { { 8, 5, 6 }, { 3, 8, 7 }, { 4, 9, 2 } }; System.out.println(findMinimum(arr)); }} |
Python3
# This program takes in two 2D arrays as # input and compares them to find out the # minimum number of changes that needs to # be made to convert arr to ms. def findMinimumFromMS(arr, ms): count = 0 for i in range(0, 3): for j in range(0, 3): if arr[i][j] != ms[i][j]: count += 1 return count def findMinimum(arr): ms = [ [ [ 8, 1, 6 ], [ 3, 5, 7 ], [ 4, 9, 2 ] ], [ [ 6, 1, 8 ], [ 7, 5, 3 ], [ 2, 9, 4 ] ], [ [ 4, 9, 2 ], [ 3, 5, 7 ], [ 8, 1, 6 ] ], [ [ 2, 9, 4 ], [ 7, 5, 3 ], [ 6, 1, 8 ] ], [ [ 8, 3, 4 ], [ 1, 5, 9 ], [ 6, 7, 2 ] ], [ [ 4, 3, 8 ], [ 9, 5, 1 ], [ 2, 7, 6 ] ], [ [ 6, 7, 2 ], [ 1, 5, 9 ], [ 8, 3, 4 ] ], [ [ 2, 7, 6 ], [ 9, 5, 1 ], [ 4, 3, 8 ] ], ] # If all the elements need to be changed, there # would be 9 changes, so we take the max as 9 Min = 9 for i in range(0, 8): x = findMinimumFromMS(arr, ms[i]) if x < Min: Min = x return Minif __name__ == "__main__": arr = [ [ 8, 5, 6 ], [ 3, 8, 7 ], [ 4, 9, 2 ] ] print(findMinimum(arr)) # This code is contributed by Rituraj Jain |
C#
using System;class GFG{ // This program takes in two 2D arrays as// input and compares them to find out the// minimum number of changes that needs to// be made to convert arr to ms.static int findMinimumFromMS(int[,] arr, int[,,] ms, int row){ int count = 0; for(int i = 0; i < 3; i++) { for(int j = 0; j < 3; j++) { if (arr[i, j] != ms[row, i, j]) { count++; } } } return count;}static int findMinimum(int[,] arr){ int[,,] ms = { { { 8, 1, 6 }, { 3, 5, 7 }, { 4, 9, 2 } }, { { 6, 1, 8 }, { 7, 5, 3 }, { 2, 9, 4 } }, { { 4, 9, 2 }, { 3, 5, 7 }, { 8, 1, 6 } }, { { 2, 9, 4 }, { 7, 5, 3 }, { 6, 1, 8 } }, { { 8, 3, 4 }, { 1, 5, 9 }, { 6, 7, 2 } }, { { 4, 3, 8 }, { 9, 5, 1 }, { 2, 7, 6 } }, { { 6, 7, 2 }, { 1, 5, 9 }, { 8, 3, 4 } }, { { 2, 7, 6 }, { 9, 5, 1 }, { 4, 3, 8 } }, }; // If all the elements need to be changed, // there would be 9 changes, so we take the // max as 9 int min = 9; for(int i = 0; i < 8; i++) { int x = findMinimumFromMS(arr, ms, i); if (x < min) { min = x; } } return min;}// Driver Codestatic public void Main(){ int[,] arr = { { 8, 5, 6 }, { 3, 8, 7 }, { 4, 9, 2 } }; Console.WriteLine(findMinimum(arr));}}// This code is contributed by avanitrachhadiya2155 |
Javascript
<script>// this program takes in two 2D arrays as// input and compares them to find out the// minimum number of changes that needs to// be made to convert arr to ms.function findMinimumFromMS(arr,ms){ let count = 0; for (let i = 0; i < 3; i++) { for (let j = 0; j < 3; j++) { if (arr[i][j] != ms[i][j]) count++; } } return count;}function findMinimum(arr){ let ms = [ [ [ 8, 1, 6 ], [ 3, 5, 7 ], [ 4, 9, 2 ] ], [ [ 6, 1, 8 ], [ 7, 5, 3 ], [ 2, 9, 4 ] ], [ [ 4, 9, 2 ], [ 3, 5, 7 ], [ 8, 1, 6 ] ], [ [ 2, 9, 4 ], [ 7, 5, 3 ], [ 6, 1, 8 ] ], [ [ 8, 3, 4 ], [ 1, 5, 9 ], [ 6, 7, 2 ] ], [ [ 4, 3, 8 ], [ 9, 5, 1 ], [ 2, 7, 6 ] ], [ [ 6, 7, 2 ], [ 1, 5, 9 ], [ 8, 3, 4 ] ], [ [ 2, 7, 6 ], [ 9, 5, 1 ], [ 4, 3, 8 ] ], ]; // If all the elements need to be changed, // there would be 9 changes, so we take the // max as 9 let min = 9; for (let i = 0; i < 8; i++) { let x = findMinimumFromMS(arr, ms[i]); if (x < min) min = x; } return min;} let arr=[[ 8, 5, 6 ], [ 3, 8, 7 ],[ 4, 9, 2 ] ];document.write(findMinimum(arr));// This code is contributed by ab2127</script> |
Output
2
Feeling lost in the world of random DSA topics, wasting time without progress? It’s time for a change! Join our DSA course, where we’ll guide you on an exciting journey to master DSA efficiently and on schedule.
Ready to dive in? Explore our Free Demo Content and join our DSA course, trusted by over 100,000 neveropen!
Ready to dive in? Explore our Free Demo Content and join our DSA course, trusted by over 100,000 neveropen!
