回答編集履歴
1
編集
answer
CHANGED
@@ -32,15 +32,15 @@
|
|
32
32
|
for (int j = 0; j < 5; j++) {
|
33
33
|
int len = 1;
|
34
34
|
for (int d = 1; j + d < 5; d++, len++) {
|
35
|
-
|
35
|
+
if (kazu[i][j] != kazu[i][j + d]) {
|
36
|
-
|
36
|
+
break;
|
37
|
-
|
37
|
+
}
|
38
38
|
}
|
39
39
|
|
40
40
|
if (len > 2) {
|
41
|
-
|
41
|
+
for (int d = 0; d < len; d++) {
|
42
|
-
|
42
|
+
kazu[i][j + d] = 0;
|
43
|
-
|
43
|
+
}
|
44
44
|
}
|
45
45
|
}
|
46
46
|
}
|