-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathP101.java
244 lines (147 loc) · 5.2 KB
/
P101.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
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
package aceptaelreto;
import java.util.*;
public class P101 {
static Scanner s;
static boolean diagonales(int[][] c, int cm) {
int diagonal1 = 0;
int diagonal2 = 0;
for (int i = c.length -1, j = 0; i >= 0; i--, j++) {
diagonal1 += c[i][j];
diagonal2 += c[j][i];
}
return (diagonal1 == cm && diagonal2 == cm);
}
static int sumacolumna(int i, int[][] c) {
int cm = 0;
for (int[] c1 : c) {
cm += c1[i];
}
return cm;
}
static int sumafila(int i, int[][] c) {
int cm = 0;
for (int p = 0; p < c.length; p++) {
cm += c[i][p];
}
return cm;
}
static int lateralespar(int[][] c) {
int cm2 = 0;
cm2 += c[0][c.length / 2]; //arriba
cm2 += c[0][(c.length / 2) - 1];
cm2 += c[c.length / 2][0]; //derecha
cm2 += c[(c.length / 2) - 1][0];
cm2 += c[c.length - 1][c.length / 2]; //abajo
cm2 += c[c.length - 1][(c.length / 2) - 1];
cm2 += c[c.length / 2][c.length - 1]; //izquierda
cm2 += c[(c.length / 2) - 1][c.length - 1];
return cm2;
}
static int centropar(int[][] c) {
int cm2 = 0;
cm2 += c[c.length / 2][c.length / 2]; //arriba derecha
cm2 += c[c.length / 2][(c.length / 2) - 1]; //arriba izquierda
cm2 += c[(c.length / 2) - 1][c.length / 2]; //abajo derecha
cm2 += c[(c.length / 2) - 1][(c.length / 2) - 1]; //abajo izquierda
return cm2;
}
static int lateralesimpar(int[][] c) {
int cm2 = 0;
cm2 += c[0][c.length / 2]; //arriba
cm2 += c[c.length / 2][0]; //izquierda
cm2 += c[c.length / 2][c.length - 1]; //derecha
cm2 += c[c.length - 1][c.length / 2]; //abajo
return cm2;
}
static int esquinas(int[][] c) {
int cm2 = 0;
cm2 += c[0][0]; //arriba izquierda
cm2 += c[0][c.length - 1]; //arriba derecha
cm2 += c[c.length - 1][0]; //abajo izquierda
cm2 += c[c.length - 1][c.length - 1]; //abajo derecha
return cm2;
}
static int constantemagica(int[][] c) {
int cm = 0;
for (int[] c1 : c) {
cm += c1[1];
}
return cm;
}
static boolean casDeProva() {
boolean esoterico;
boolean diabolico;
int[][] c;
int[] rep;
int nums, cm, cm2, numero;
nums = s.nextInt();
if (nums == 0) {
return false;
} else {
c = new int[nums][nums];
rep = new int[nums * nums];
esoterico = true;
diabolico = true;
for (int i = 0; i < nums; i++) {
for (int o = 0; o < nums; o++) {
numero = s.nextInt();
c[i][o] = numero;
if (numero > (nums * nums) || rep[numero - 1] == 1) {
esoterico = false;
} else if (numero <= (nums * nums)) {
rep[numero - 1] = 1;
}
}
}
cm = constantemagica(c);
cm2 = (4 * cm) / nums;
for (int i = 0; i < c.length; i++) {
if (sumafila(i, c) != cm) {
diabolico = false;
break;
}
if (sumacolumna(i, c) != cm) {
diabolico = false;
break;
}
}
if (diabolico && !diagonales(c, cm))
diabolico = false;
if (diabolico && esoterico) {
if (cm2 != esquinas(c)) {
diabolico = false;
} else {
if (nums % 2 == 1) {
if (c[c.length / 2][c.length / 2] * 4 != cm2) {
esoterico = false;
} else {
if (lateralesimpar(c) != cm2) {
esoterico = false;
}
}
} else if (nums % 2 == 0) {
if (centropar(c) != cm2) {
esoterico = false;
} else {
if (lateralespar(c) != (cm2 * 2)) {
esoterico = false;
}
}
}
}
}
if (diabolico && esoterico) {
System.out.println("ESOTERICO");
} else if (diabolico) {
System.out.println("DIABOLICO");
} else {
System.out.println("NO");
}
return true;
}
}
public static void main(String[] args) {
s = new Scanner(System.in);
while (casDeProva());
}
}