JAVA "magic square"判定算法的实现。

package com.qiqi;

import java.util.Scanner;

/**
 * 
 * Magic squares. An n*n matrix that is filled with the numbers 1, 2, 3, . . . , n2 is a
 * magic square if the sum of the elements in each row, in each column, and in the two
 * diagonals is the same value. For example,
 * 
 *　　16   3    2    13
 *　　5    10   11   8
 *　　9    6    7    12
 *　　4    15   14   1
 * 
 * Write a program that reads in n2 values from the keyboard and tests whether they
 * orm a magic square when arranged as a square matrix. You need to test three
 * features:
 * • Did the user enter n2 numbers for some n?
 * • Do each of the numbers 1, 2, . . . , n2 occur exactly once in the user input?
 * • When the numbers are put into a square, are the sums of the rows, columns,
 * and diagonals equal to each other?
 * If the size of the input is a square, test whether all numbers between 1 and n2 are
 * present. Then compute the row, column, and diagonal s