Decompiled by Jad v1 8e Copyright 2001 Pavel Kouznetsov Jad home page

  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
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
// Decompiled by Jad v1.5.8e. Copyright 2001 Pavel Kouznetsov.
// Jad home page: http://www.geocities.com/kpdus/jad.html
// Decompiler options: packimports(3)
package com.stanfy.contest.a.a;
import com.stanfy.contest.a.a.b.b;
import java.util.HashMap;
// Referenced classes of package com.stanfy.contest.a.a:
// u, e, f
public class h extends u
{
public h()
{
c = new char[6][2][2];
e = "ABABAGALAMAGA";
f = "";
g = false;
for(int k = 0; k < 6; k++)
{
for(int i1 = 0; i1 < 2; i1++)
{
for(int j1 = 0; j1 < 2; j1++)
c[k][i1][j1] = d[k];
}
}
for(int l = 0; l < 200; l++)
if(l % 2 == 1)
a((int)(Math.random() * 2D), Math.random() > 0.5D);
else
b((int)(Math.random() * 2D), Math.random() > 0.5D);
}
public final void a(b b1)
{
super.a(b1);
c("\r\n======================== DNA LAB ====================\r\n");
c("DNA LAB module initiated. Use (help|man) dna; to get help about the module\r\n");
h();
}
public final void a(String s)
{
if(b)
return;
if(s.isEmpty())
return;
if(!e.startsWith((new StringBuilder()).append(f).append(s).toString().toUpperCase()))
break MISSING_BLOCK_LABEL_78;
new StringBuilder();
this;
JVM INSTR dup_x1 ;
f;
append();
s;
append();
toString();
f;
break MISSING_BLOCK_LABEL_84;
f = "";
if(f.equalsIgnoreCase(e) && !g)
{
c("\r\nDeeper DNA processing is enabled. Process DNA to get correct DMA token\r\n");
g = true;
}
if(s.equalsIgnoreCase("help dna") || s.equalsIgnoreCase("man dna") || s.equalsIgnoreCase("help"))
{
this = this;
(s = new StringBuilder()).append("\r\n======================== DNA LAB ====================\r\n");
s.append("DNA Lab is the tool with extremely high usabilty.\r\n");
s.append("It uses twelve aminoacids for restructuring DNA parts.\r\n");
s.append("Aminoacids that can be used in DNA LAB:\r\n");
s.append(" - sigma dimension aminoacids :\r\n");
s.append(" Lysine(LA), Proline(PR)\r\n");
s.append(" - sigma dimension aminoacids antipodes:\r\n");
s.append(" Tyrosine(TY), Methionine(MA)\r\n");
s.append(" - theta dimension aminoacids :\r\n");
s.append(" Alanine(A), Valin(BA)\r\n");
s.append(" - theta dimension aminoacids antipodes:\r\n");
s.append(" Serine(SE), Glycine(GA)\r\n");
s.append(" \r\n");
s.append(" LA PR <----- sigma dimension \r\n");
s.append(" ------ .------ theta dimension \r\n");
s.append(" A | CC NN | SE \r\n");
s.append(" BA | NN OO | GA \r\n");
s.append(" ------ \r\n");
s.append(" TY MA <------- sigma dimension antipodes \r\n");
s.append(" \r\n");
s.append(" DNA reperesented as two intersected thoroidal dimensions\r\n");
s.append("such as theta and sigma dimension. Using of aminoacid,\r\n");
s.append("can be done by inputing it's short name i.e. 'A' for Alanine,\r\n");
s.append("to process DNA, input 'process'. For correct DNA processing,\r\n");
s.append("DNA must be in absolute form, when each projection of DNA on \r\n");
s.append("each dimension are .equ.l. Do.not tr..us..D.A...B..for..t. \r\n");
s.append("fr...I..a...v.....n...........................sdax........ \r\n");
s.append("............sm,cia......F.................r....a.......... \r\n");
s.append("n.................dpqf,a...k..vjikqoa..............o...... \r\n");
s.append((new StringBuilder()).append(">> Data corrupted. End of data ").append(g()).toString());
c(s.toString());
return;
}
switch(s.toUpperCase().charAt(0))
{
case 67: // 'C'
case 68: // 'D'
case 69: // 'E'
case 70: // 'F'
case 72: // 'H'
case 73: // 'I'
case 74: // 'J'
case 75: // 'K'
case 78: // 'N'
case 79: // 'O'
case 82: // 'R'
default:
break;
case 65: // 'A'
if(s.equalsIgnoreCase("A"))
{
a(0, true);
h();
return;
}
break;
case 66: // 'B'
if(s.equalsIgnoreCase("BA"))
{
a(1, true);
h();
return;
}
break;
case 71: // 'G'
if(s.equalsIgnoreCase("GA"))
{
a(1, false);
h();
return;
}
break;
case 76: // 'L'
if(s.equalsIgnoreCase("LA"))
{
b(0, true);
h();
return;
}
break;
case 77: // 'M'
if(s.equalsIgnoreCase("MA"))
{
b(1, false);
h();
return;
}
break;
case 80: // 'P'
if(s.equalsIgnoreCase("PR"))
{
b(1, true);
h();
return;
}
if(!s.equalsIgnoreCase("PROCESS"))
break;
if(!e())
c((new StringBuilder()).append("\r\nCannot process DNA. DNA is not in absolute form").append(g()).toString());
return;
case 83: // 'S'
if(s.equalsIgnoreCase("SE"))
{
a(0, false);
h();
return;
}
break;
case 84: // 'T'
if(s.equalsIgnoreCase("TY"))
{
b(0, false);
h();
return;
}
break;
case 81: // 'Q'
if(s.equalsIgnoreCase("QUIT"))
{
b("statusExit");
return;
}
break;
}
c((new StringBuilder()).append("").append(g()).toString());
return;
}
private boolean e()
{
for(int k = 0; k < 6; k++)
{
char c1 = c[k][0][0];
for(int l = 0; l < 2; l++)
{
for(int i1 = 0; i1 < 2; i1++)
if(c1 != c[k][l][i1])
return false;
}
}
h = true;
a(new String[] {
"DNA has been successfully processed.... \r\n", "Checking environment", ".", ".", ".", "............ \r\n", "5 substance types found. \r\n", "Configuring sensors .... \r\n", "Destructable substance found. Identifier - 'w'. \r\n", "Indestructable substance found. Identifier - 'X'. \r\n",
"Unknown, possibly dangerous substance found. Identifier - '*'. Has constant life time. \r\n", "Extremely dangerous substance with high temperature. Identifier - '#'. Has cross shape. With constant ray length.\r\n", (new StringBuilder()).append("Potentially positive substance found. Has several types. Identifiers - 'b', 'f', 'v', '?'. \r\n").append(g ? " '?' - type analizyng... Can contain several undesirable subtype - 'r', 's', 'u', 'o'. \r\n" : " '?' - unknown substance type. Possibly positive. Need deeper analysis through Gryc's Science approach. \r\n").toString(), "Sensor configuration token : ", (new StringBuilder()).append(g ? e("dGmoZ8uKLC0K0Mox0D3T") : e("RhkyCmdgAemW9x8TWVSu")).append("\r\n").toString(), "DNA processed token : ", (new StringBuilder()).append(g ? d("c4qKx5lSLufnzkrdeg7o") : d("KLJexj8DlAi4m1g5Xpf2")).append("\r\n").append("Information about substances format : \r\n").append("info ::= ( <game-info> | <start-round-info> | <map-change-info> | <finish-round-info> | <finish-game-info> ) ';'\r\n").append("map-change-info ::= <time-part> '&' <players-part> '&' <changes-part> [ '&' <danger-part>]\r\n").append("changes-part ::= [ <change-info> [ { ',' <change-info> } ] ]\r\n").append("change-info ::= <add-info> | <remove-info>\r\n").append("add-info ::= '+' ( <add-dangerous-substance> | <add-bonus-substance> | <add-hightemp-substance> | <add-destr-substance> | <add-indestr-substance> )\r\n").append("add-dangerous-substance ::= '*' <sep> <cell-position> <sep> <damaging-range> <sep> <boom-time>\r\n").append("add-bonus-substance ::= <bonus-type> <sep> <cell-position>\r\n").append("add-destr-substance ::= 'w' <sep> <cell-position>\r\n").append("add-indestr-substance ::= 'X' <sep> <cell-position>\r\n").append("add-hightemp-substance ::= '#' <sep> <cell-position> <sep> <damaging-range> <sep> <end-time>\r\n").append("boom-time ::= <number>\r\n").append("end-time ::= <number> \r\n").append("remove-info ::= '-' ( <remove-dangerous-substance> | <remove-bonus-substance> | <remove-hightemp-substance> | <remove-destr-substance> )\r\n").append("remove-dangerous-substance ::= '*' <sep> <cell-position>\r\n").append("remove-bonus-substance ::= <bonus-type> <sep> <cell-position>\r\n").append("remove-hightemp-substance ::= '#' <sep> <cell-position> <sep> <damaging-range>\r\n").append("remove-destr-substance ::= 'w' <sep> <cell-position>\r\n").append("bonus-type ::= 'b' | 'v' | 'f' | 'r' | 's' | 'u' | 'o' | '?'\r\n").append("damaging-range ::= <number>\r\n").append("cell-position ::= <x-cell> <sep> <y-cell>\r\n").append("x-cell ::= <number>\r\n").append("y-cell ::= <number> \r\n").toString()
});
c(g());
return true;
}
private void a(int k, boolean flag)
{
char ac[] = c[0][k];
for(int l = 0; l < 3; l++)
if(flag)
c[l][k] = c[l + 1][k];
else
c[(4 - l) % 4][k] = c[(3 - l) % 4][k];
if(flag)
{
c[3][k] = ac;
return;
} else
{
c[1][k] = ac;
return;
}
}
private void b(int k, boolean flag)
{
flag = flag ? ((boolean) (i)) : ((boolean) (j));
int ai[] = new int[4];
for(int k1 = 0; k1 < flag.length; k1++)
ai[k1] = flag[k1] != 3 ? k : 3 - k;
char ac[] = new char[2];
for(int l = 0; l < 2; l++)
ac[l] = c[flag[0]][l][k];
for(int i1 = 0; i1 < flag.length - 1; i1++)
{
boolean flag1 = 3 == flag[i1];
boolean flag2 = 3 == flag[i1 + 1];
for(int l1 = 0; l1 < 2; l1++)
c[flag[i1]][flag1 ? 1 - l1 : l1][flag1 ? 1 - k : k] = c[flag[i1 + 1]][flag2 ? 1 - l1 : l1][flag2 ? 1 - k : k];
}
for(int j1 = 0; j1 < 2; j1++)
c[flag[3]][j1][k] = ac[j1];
}
private void h()
{
StringBuilder stringbuilder;
(stringbuilder = new StringBuilder()).append("\r\n");
for(int k = 0; k < 2; k++)
{
for(int l = 0; l < 2; l++)
{
for(int i1 = 0; i1 < 2; i1++)
{
stringbuilder.append(" ");
stringbuilder.append(c[1][k][i1]);
stringbuilder.append(c[1][k][i1]);
}
stringbuilder.append("\r\n");
}
}
c((new StringBuilder()).append(stringbuilder.toString()).append(">").toString());
}
public final HashMap a_()
{
HashMap hashmap;
(hashmap = super.a_()).put(d("c4qKx5lSLufnzkrdeg7o"), new e(this, com/stanfy/contest/a/a/h));
hashmap.put(d("KLJexj8DlAi4m1g5Xpf2"), new f(this, com/stanfy/contest/a/a/h));
return hashmap;
}
public final boolean c()
{
return g;
}
public final String d()
{
return (new StringBuilder()).append("DNA LAB - DNA is ").append(h ? "" : "NOT").append(" processed. ").append(g ? "Deeper research done." : "").toString();
}
public final String b()
{
return "dnalab";
}
static boolean a(h h1, boolean flag)
{
return h1.g = true;
}
static boolean b(h h1, boolean flag)
{
return h1.h = true;
}
private char c[][][];
private char d[] = {
'P', 'C', 'N', 'O', 'H', 'B'
};
private String e;
private String f;
private boolean g;
private boolean h;
private static final int i[] = {
1, 4, 3, 5
};
private static final int j[] = {
5, 3, 4, 1
};
}