-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathp160.java
116 lines (101 loc) · 2.85 KB
/
p160.java
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
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
package com.caiomed03.aceptaelreto;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
public class p160 {
static class FastReader {
BufferedReader br;
StringTokenizer st;
public FastReader() {
br = new BufferedReader(
new InputStreamReader(System.in));
}
String next() {
while (st == null || !st.hasMoreElements()) {
try {
st = new StringTokenizer(br.readLine());
} catch (IOException e) {
e.printStackTrace();
}
}
return st.nextToken();
}
int nextInt() {
return Integer.parseInt(next());
}
long nextLong() {
return Long.parseLong(next());
}
double nextDouble() {
return Double.parseDouble(next());
}
String nextLine() {
String str = "";
try {
str = br.readLine();
} catch (IOException e) {
e.printStackTrace();
}
return str;
}
boolean hasNext() {
if (st != null && st.hasMoreTokens()) {
return true;
}
String tmp;
try {
br.mark(1000);
tmp = br.readLine();
if (tmp == null) {
return false;
}
br.reset();
} catch (IOException e) {
return false;
}
return true;
}
}
static boolean check(int[][] a) {
boolean flag = true;
for (int i = 0; i < a.length; i++) {
for (int j = i+1; j < a.length; j++) {
if (a[j][i] != 0) {
flag = false;
break;
}
}
}
if (flag) {
return true;
} else {
for (int i = 0; i < a[0].length; i++) {
for (int j = i + 1; j < a[0].length; j++) {
if (a[i][j] != 0) {
return false;
}
}
}
}
return true;
}
public static void main(String[] args) {
FastReader sc = new FastReader();
int matriz = sc.nextInt();
while (!(matriz == 0)) {
int[][] a = new int[matriz][matriz];
for (int i = 0; i < matriz; i++) {
for (int j = 0; j < matriz; j++) {
a[i][j] = sc.nextInt();
}
}
if (check(a)) {
System.out.println("SI");
} else {
System.out.println("NO");
}
matriz = sc.nextInt();
}
}
}