ตรวจสอบจตุรัสกล (Magic Square)

import java.util.Scanner;
 
public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
 
        int matrixSize = scanner.nextInt();
        int[][] matrix = new int[matrixSize][matrixSize];
 
        for (int i = 0; i < matrixSize; i++) {
            for (int j = 0; j < matrixSize; j++) {
                matrix[i][j] = scanner.nextInt();
            }
        }
 
        int[] verticalSum = new int[matrixSize];
        int[] horizontalSum = new int[matrixSize];
        int diagonalLeftSum = 0;
        int diagonalRightSum = 0;
 
        for (int i = 0; i < matrixSize; i++) {
            for (int j = 0; j < matrixSize; j++) {
                horizontalSum[i] += matrix[i][j];
                verticalSum[j] += matrix[i][j];
            }
            diagonalLeftSum += matrix[i][i];
            diagonalRightSum += matrix[i][matrixSize - i - 1];
        }
 
        int referenceSum = horizontalSum[0];
 
        boolean isMagicSquare = true;
 
        for (int sum : horizontalSum) {
            if (sum != referenceSum) {
                isMagicSquare = false;
                break;
            }
        }
 
        if (isMagicSquare) {
            for (int sum : verticalSum) {
                if (sum != referenceSum) {
                    isMagicSquare = false;
                    break;
                }
            }
        }
 
        if (isMagicSquare) {
            if (diagonalLeftSum != referenceSum || diagonalRightSum != referenceSum) {
                isMagicSquare = false;
            }
        }
 
        System.out.println(isMagicSquare);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        int matrixSize = scanner.nextInt();
        int[][] matrix = new int[matrixSize][matrixSize];

        for (int i = 0; i < matrixSize; i++) {
            for (int j = 0; j < matrixSize; j++) {
                matrix[i][j] = scanner.nextInt();
            }
        }

        int[] verticalSum = new int[matrixSize];
        int[] horizontalSum = new int[matrixSize];
        int diagonalLeftSum = 0;
        int diagonalRightSum = 0;

        for (int i = 0; i < matrixSize; i++) {
            for (int j = 0; j < matrixSize; j++) {
                horizontalSum[i] += matrix[i][j];
                verticalSum[j] += matrix[i][j];
            }
            diagonalLeftSum += matrix[i][i];
            diagonalRightSum += matrix[i][matrixSize - i - 1];
        }

        int referenceSum = horizontalSum[0];

        boolean isMagicSquare = true;
 
        for (int sum : horizontalSum) {
            if (sum != referenceSum) {
                isMagicSquare = false;
                break;
            }
        }

        if (isMagicSquare) {
            for (int sum : verticalSum) {
                if (sum != referenceSum) {
                    isMagicSquare = false;
                    break;
                }
            }
        }

        if (isMagicSquare) {
            if (diagonalLeftSum != referenceSum || diagonalRightSum != referenceSum) {
                isMagicSquare = false;
            }
        }

        System.out.println(isMagicSquare);