# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
290478 | matheo_apd | Chessboard (IZhO18_chessboard) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define maxn 105
int chess[maxn][maxn];
int main(){
int n, k;
cin >> n >> k;
for(int i = 0; i < k; i++){
int x, y;
cin >> x >> y;
cin >> x >> y; //8)
}
int cont_errado = 0;
for(int i = 1; i <= n; i++)
for(int j = 1; j <= n; j++)
if(i+j)%2 == chess[i][j]) cont_errado++;
cout << min(cont_errado, n*n - cont_errado) << endl;
return 0;
}