小明的bingo正经题解

#include<bits/stdc++.h>
using namespace std;
int n, a[1010][1010];
int main(){
    cin >> n;
    int cnt = 0;
    int sum1 = 0, sum2 = 0;
    for(int i = 1; i <= n; i++){
        int sum = 0;
        for(int j = 1; j <= n; j++){
            cin >> a[i][j];
            sum += a[i][j];
            if(i == j) sum1 += a[i][j];
            if(i + j == n + 1) sum2 += a[i][j];
        }
        if(sum % 2) cnt++;
    }
    if(sum1 % 2) cnt++;
    if(sum2 % 2) cnt++;
    for(int j = 1; j <= n; j++){
        int sum = 0;
        for(int i = 1; i <= n; i++){
            sum += a[i][j];
        }
        if(sum % 2) cnt++;
    }
    cout << cnt;
    return 0;
}