-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path1018.cpp
More file actions
63 lines (55 loc) · 1009 Bytes
/
1018.cpp
File metadata and controls
63 lines (55 loc) · 1009 Bytes
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
#include <iostream>
#include <string>
using namespace std;
char chess1[8][8];
char chess2[8][8];
char arr[51][51];
int Min(int a, int b) {
return a < b ? a : b;
}
int main(void) {
int N, M;
scanf("%d %d", &N, &M);
for (int i = 0; i < N; i++) {
string s;
cin >> s;
for (int j = 0; j < M; j++) {
arr[i][j] = s[j];
}
}
bool W_B = false;
for (int i = 0; i < 8; i++) {
for (int j = 0; j < 8; j++) {
if (W_B == false) {
chess1[i][j] = 'W';
chess2[i][j] = 'B';
W_B = !W_B;
}
else {
chess1[i][j] = 'B';
chess2[i][j] = 'W';
W_B = !W_B;
}
}
W_B = !W_B;
}
int min = 55;
for (int i = 0; i <= N - 8; i++) {
for (int j = 0; j <= M - 8; j++) {
int cnt1 = 0, cnt2 = 0;
for (int a = 0; a < 8; a++) {
for (int b = 0; b < 8; b++) {
if (arr[i+a][j+b] != chess1[a][b]) {
++cnt1;
}
if (arr[i+a][j+b] != chess2[a][b]) {
++cnt2;
}
}
}
min = Min(min, Min(cnt1, cnt2));
}
}
printf("%d", min);
getchar();
}