回答編集履歴
2
答えの訂正
answer
CHANGED
|
@@ -1,4 +1,11 @@
|
|
|
1
|
-
for(int i = 0; i < 2; i++)
|
|
1
|
+
for(int i = 0; i < 2; i++){
|
|
2
|
-
for(int j = 0; j < 2; j++)
|
|
2
|
+
for(int j = 0; j < 2; j++){
|
|
3
|
-
if(b[i][j] == 0)
|
|
3
|
+
if(b[i][j] == 0)
|
|
4
|
+
flag0 = true;
|
|
4
|
-
|
|
5
|
+
else if(b[i][j] == 1)
|
|
6
|
+
flag1 = true;
|
|
7
|
+
}
|
|
8
|
+
}
|
|
9
|
+
if(flag0 && flag1){
|
|
10
|
+
|
|
11
|
+
}
|
1
補足
answer
CHANGED
|
@@ -1,4 +1,4 @@
|
|
|
1
1
|
for(int i = 0; i < 2; i++)
|
|
2
2
|
for(int j = 0; j < 2; j++)
|
|
3
|
-
if(b[i][j] == 0)
|
|
3
|
+
if(b[i][j] == 0){
|
|
4
4
|
if(b[0][0] == 1 || b[0][1] == 1 || b[1][0] == 1 || b[1][1] == 1)
|