Submission #290479

#TimeUsernameProblemLanguageResultExecution timeMemory
290479matheo_apdChessboard (IZhO18_chessboard)C++14
0 / 100
139 ms1912 KiB
#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; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...