algorithm'''problem solve
[백준]1018-체스판 다시 칠하기(설명X)
JunHwa Park
2019. 8. 16. 18:43
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
|
#include <iostream>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
char** ary = new char* [N];
for (int i = 0; i < N; i++) {
ary[i] = new char[M + 1];
cin >> ary[i];
}
int tmp, min = N * M;
for (int i = 0; i < N - 7; i++) {
for (int j = 0; j < M - 7; j++) {
tmp = 0;
for (int a = 0; a < 8; a++)
for (int b = 0; b < 8; b++) {
if (((a + b) % 2) == 0 && ary[a + i][b + j] == 'W')
tmp++;
else if (((a + b) % 2) == 1 && ary[a + i][b + j] == 'B')
tmp++;
}
if (tmp > 32)
tmp = 64 - tmp;
if (min > tmp)
min = tmp;
}
}
cout << min << endl;
for (int i = 0; i < N; i++)
delete[] ary[i];
delete[] ary;
}
|
cs |
부르트 포스..
코드 작성하면서도 짜증나고 신경쓰인다..