求幻方的

#include <iostream>
#include <vector>
 using namespace std;
bool M(vector<vector<int>>square,int n) {
    int sum = n*(n+1)/2;
    for (int i = 0; i < n; ++i) {
        int rowSum = 0;
        int colSum = 0;
        int diag1Sum = 0;
        int diag2Sum = 0;
        for (int j = 0; j < n; ++j) {
            rowSum += square[i][j];
            colSum += square[j][i];
            if (i == j) {
                diag1Sum += square[i][j];
            }
            if (i + j == n - 1) {
                diag2Sum += square[i][j];
            }
        }
        if (rowSum != sum || colSum != sum || diag1Sum != sum || diag2Sum != sum) {
            return false;
        }
    }
    return true;
}
 int a[105][105];
int main() {
    int n;
    cin>>n;
    for(int i=1;i<=n;i++)
    {
    	for(int j=1;j<=n;j++)cin>>a[i][j];
    }
    if (M(a,n)) {
        cout << "Yes" <<endl;
    } else {
        cout << "No" << endl;
    }
    return 0;
}

小猴编程（5525411785305547）