C program to find magic square matrix

C program to find magic square matrix


Output:

The given matrix is magic square matrix

Implementation:

#include <stdio.h> #define r 3 #define c 3 int main(void) { int a[r][c]={{4,9,2}, {3,5,7}, {8,1,6}}; int i,j,k; int flag=1; int sum[r+c+2]={0}; /* Magic square matrix is the matrix with row sum = column sum = diagonal sum for example: take the matrix: 4 9 2 3 5 7 8 1 6 It has row sums as: row1 = 4 + 9 + 2 = 15 row2 = 3 + 5 + 7 = 15 row3 = 8 + 1 + 6 = 15 It has column sums as: column1 = 4 + 3 + 8 = 15 column2 = 9 + 5 + 1 = 15 column3 = 2 + 7 + 6 = 15 Finally, left diagonal sum = 4 + 5 + 6 = 15 right diagonal sum = 2 + 5 + 8 = 15 Since, all the rows & columns & diagonals have same sum Hence, the matrix is a magic square matrix with all values from 1 to 9(rows*columns = 3 * 3) and placed in the matrix exactly only once */ k=0; /* checking for rows */ for(i=0;i<r;i++) { for(j=0;j<c;j++) { sum[k] += a[i][j]; } k++; } /* checking for columns */ for(j=0;j<c;j++) { for(i=0;i<r;i++) { sum[k] += a[i][j]; } k++; } /* checking for diagonals */ for(i=0;i<r;i++) { for(j=0;j<c;j++) { if(i==j) sum[k] += a[i][j]; if(j==(r-i-1)) sum[k+1] += a[i][j]; } } /* checking all the values of sum*/ for(i=0;i<k+1;i++) { if(sum[i]!=sum[i+1]) flag=0; } if(flag) printf("The given matrix is magic square matrix"); else printf("The given matrix is not a magic square matrix"); return 0; }