-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathchess
70 lines (56 loc) · 1.16 KB
/
chess
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
64
65
66
67
68
69
70
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int n = in.nextInt();
int sum = 0;
int[][] board = new int[n][n];
String flag = "NIL";
for (int i = 0; i < n; i ++) {
for (int j = 0; j < n; j ++) {
board [i][j] = in.nextInt();
}
}
for (int i = 0; i < n; i ++) {
sum = 0;
for (int j = 0; j < n; j ++) {
sum += board [i][j];
}
if (sum == n ) {
flag = "X"; break; }
else if (sum == 0) {
flag = "O"; break; }
}
for (int j = 0; j < n; j ++) {
sum = 0;
for (int i = 0; i < n; i ++) {
sum += board [i][j];
}
if (sum == n ) {
flag = "X"; break; }
else if (sum == 0) {
flag = "O"; break; }
}
{
sum = 0;
for (int k = 0; k < n; k ++) {
sum += board[k][k];
}
if (sum == n ) {
flag = "X"; }
else if (sum == 0 || sum == n) {
flag = "O"; }
}
{
sum = 0;
for (int k = 0; k < n; k ++) {
sum += board[k][n-k-1];
}
if (sum == n ) {
flag = "X"; }
else if (sum == 0 || sum == n) {
flag = "O"; }
}
System.out.print(flag);
}
}