-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathba.java
292 lines (257 loc) · 7.45 KB
/
ba.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
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
public final class ba {
public static final int[][] a;
private static int[] a;
private static int[] b;
private static int a;
private static int b;
private static int c;
private static boolean a;
private static int d;
private static boolean b;
private static boolean c;
private static int e;
private static int f;
public static void a(cr var0) {
int var1 = 0;
int var2 = 0;
int var4;
if (bl.a() > 7) {
v[] var3;
if ((var3 = bl.a().a()) != null) {
for(var4 = 0; var4 < var3.length; ++var4) {
if (var3[var4] != null && var3[var4].b() != 4) {
if (var3[var4].b() == 0) {
++c;
} else if (var3[var4].b() == 3) {
++var1;
continue;
}
++var2;
}
}
}
a = var2 > 0 && var1 > 0;
} else {
a = true;
}
boolean var7 = false;
for(var2 = 0; var2 < a.length; ++var2) {
int var8 = 0;
if (a[var2] != 1) {
for(var4 = 0; var4 < a[var2].length && var8 <= 0; ++var4) {
var7 = false;
int var6;
switch(var2) {
case 1:
var7 = var0.c() <= a[var2][var4];
break;
case 2:
case 3:
case 9:
case 12:
boolean[] var5 = var2 == 2 ? bl.b : (var2 == 3 ? bl.c : (var2 == 9 ? bl.d : bl.e));
var1 = 0;
var6 = 0;
for(; var6 < var5.length; ++var6) {
if (var5[var6]) {
++var1;
}
}
var7 = var1 >= a[var2][var4];
break;
case 4:
var7 = bl.j() >= a[var2][var4];
break;
case 5:
var7 = bl.k > a[var2][var4];
break;
case 6:
var7 = bl.l > a[var2][var4];
break;
case 7:
var7 = bl.m > a[var2][var4];
break;
case 8:
var7 = bl.n > a[var2][var4];
break;
case 10:
var7 = bl.o > a[var2][var4];
break;
case 11:
var7 = bl.e() >= a[var2][var4];
break;
case 13:
var1 = 0;
for(var6 = 0; var6 < bl.a.length; ++var6) {
if (bl.a[var6].a) {
++var1;
}
}
var7 = var1 >= a[var2][var4];
break;
case 14:
var1 = 0;
for(var6 = 0; var6 < bl.a.length; ++var6) {
if (bl.a[var6].c > 0) {
++var1;
}
}
var7 = var1 >= a[var2][var4];
break;
case 15:
var7 = bl.a() > (long)(a[var2][var4] * 3600000);
break;
case 16:
var7 = bl.l() > a[var2][var4];
break;
case 17:
var7 = bl.b() >= a[var2][var4];
break;
case 18:
var7 = bl.p > a[var2][var4];
break;
case 19:
var7 = bl.d / 60000L >= (long)a[var2][var4];
break;
case 20:
var7 = bl.q > a[var2][var4];
break;
case 21:
var7 = bl.r > a[var2][var4];
break;
case 22:
var7 = !a;
break;
case 23:
var7 = c >= a[var2][var4];
break;
case 24:
var7 = bl.c() >= a[var2][var4];
break;
case 25:
var7 = d >= a[var2][var4];
break;
case 26:
var7 = bl.s > a[var2][var4];
break;
case 27:
var7 = bl.t > a[var2][var4];
break;
case 28:
var7 = bl.a().a();
break;
case 29:
var7 = bl.u > a[var2][var4];
break;
case 30:
var7 = bl.a();
break;
case 31:
var7 = bl.v > a[var2][var4];
break;
case 32:
var7 = bl.w > a[var2][var4];
break;
case 33:
var7 = bl.x > a[var2][var4];
break;
case 34:
var7 = bl.y > a[var2][var4];
break;
case 35:
var7 = bl.z > a[var2][var4];
break;
case 36:
var7 = true;
for(var6 = 0; var6 < a.length - 1; ++var6) {
if (a[var6] == 0) {
var7 = false;
break;
}
}
}
if (var7) {
var8 = var4 + 1;
}
}
}
if (a[var2] > var8 || a[var2] == 0) {
b[var2] = var8;
}
}
}
private static void f() {
f = 0;
e = 0;
for(int var0 = 0; var0 < a.length; ++var0) {
if (a[var0] == 1) {
++f;
++e;
} else if (a[var0] != 0) {
++f;
}
}
b = f == a.length;
c = e == a.length;
}
public static boolean a() {
return b;
}
public static boolean b() {
return c;
}
public static int[] a() {
return a;
}
public static int[] b() {
return b;
}
public static void a() {
++a;
}
public static void b() {
++b;
}
public static void a(int var0) {
if (var0 > d) {
d = var0;
}
}
public static void a(int[] var0) {
a = var0;
}
public static void c() {
for(int var0 = 0; var0 < a.length; ++var0) {
a[var0] = 0;
}
a[0] = 1;
e();
d = 0;
}
public static void d() {
for(int var0 = 0; var0 < a.length; ++var0) {
if (b[var0] > 0 && (b[var0] < a[var0] || a[var0] == 0)) {
a[var0] = b[var0];
}
}
f();
if (f == a.length - 1) {
b[a.length - 1] = 1;
a[a.length - 1] = 1;
f();
}
}
public static void e() {
for(int var0 = 0; var0 < b.length; ++var0) {
b[var0] = 0;
}
a = 0;
b = 0;
c = 0;
a = false;
}
static {
a = new int[(a = new int[][]{{0}, {5, 15, 30}, {11, 8, 5}, {11, 8, 5}, {250, 100, 50}, {200, 100, 25}, {1000, 500, 100}, {25, 10, 3}, {1000, 100, 25}, {22, 16, 5}, {150, 100, 30}, {100, 50, 25}, {22, 10, 5}, {13, 6, 3}, {13, 6, 3}, {20, 10, 5}, {50, 25, 5}, {100, 50, 10}, {50, 20, 5}, {5, 3, 2}, {50, 20, 5}, {25, 10, 5}, {0}, {4, 3, 2}, {500, 200, 50}, {1000000, 500000, 125000}, {100, 50, 20}, {20, 10, 3}, {1}, {500, 250, 50}, {0}, {500, 250, 100}, {50}, {5}, {10}, {12}, {0}}).length];
b = new int[a.length];
}
}