📄 aa.java
字号:
{
k = 22;
a();
return;
} else
{
return;
}
}
private static void K()
{
a(465, o >> 1, p >> 1, (byte)70, a, o - 10);
a(466, o >> 1, p - 2, (byte)12, a, 0);
}
public static void a(z z1)
{
if(z1 == null)
return;
g g1 = a[9];
t t1 = new t();
z1.b(t1);
if(((q) (z1)).i == 1)
{
switch(z1.a.b)
{
case 24: // '\030'
if(((q) (z1)).a_ == 0)
{
g1.a(21, (((q) (z1)).o - (g1.a[21] >> 1)) + 8, t1.b - 1 - g1.b[21], 0, a, false, 0);
return;
} else
{
g1.a(21, ((q) (z1)).o - (g1.a[21] >> 1) - 8, t1.b - 1 - g1.b[21], 0, a, false, 0);
return;
}
case 20: // '\024'
if(((q) (z1)).a_ == 0)
{
g1.a(21, (((q) (z1)).o - (g1.a[21] >> 1)) + 4, t1.b - 1 - g1.b[21], 0, a, false, 0);
return;
} else
{
g1.a(21, ((q) (z1)).o - (g1.a[21] >> 1) - 4, t1.b - 1 - g1.b[21], 0, a, false, 0);
return;
}
}
g1.a(21, ((q) (z1)).o - (g1.a[21] >> 1), t1.b - 1 - g1.b[21], 0, a, false, 0);
return;
}
if(((q) (z1)).i == 6 && z1.a.b == 11)
{
g1.a(21, ((q) (z1)).o - (g1.a[21] >> 1) - 4, t1.b - 1 - g1.b[21], 0, a, false, 0);
return;
} else
{
g1.a(21, ((q) (z1)).o - (g1.a[21] >> 1), t1.b - 1 - g1.b[21], 0, a, false, 0);
return;
}
}
private static void L()
{
i(72);
b = (short)d();
if(b <= 0)
{
b = 0;
return;
}
d = new short[b];
for(int i1 = 0; i1 < b; i1++)
{
d();
e();
d[i1] = a(a);
}
}
private static boolean b(int i1)
{
if(w.c)
return false;
for(int j1 = 0; j1 < b; j1++)
if(i1 == d[j1])
return true;
return false;
}
private static void M()
{
B = 19;
if(B > 0)
a = new k[B];
for(int i1 = 0; i1 < B; i1++)
{
a[i1] = new k();
a[i1].a = (byte)i1;
a[i1].a();
}
}
public static k a(int i1)
{
return a[i1];
}
private static void N()
{
C = 5;
a = new ae[C];
for(int i1 = 0; i1 < C; i1++)
{
a[i1] = new ae();
a[i1].a = (byte)i1;
a[i1].a();
}
}
public static ae a(int i1)
{
return a[i1];
}
private static void O()
{
a = new int[9][4];
a = -1;
b = 0;
a[8][0] = 512;
a[8][1] = 8;
a[8][2] = 128;
a[8][3] = 1;
a[0][0] = 64;
a[0][1] = 1;
a[0][2] = 128;
a[0][3] = 4;
a[1][0] = 4;
a[1][1] = 8;
a[1][2] = 256;
a[1][3] = 512;
a[2][0] = 256;
a[2][1] = 64;
a[2][2] = 128;
a[2][3] = 512;
a[4][0] = 1;
a[4][1] = 4;
a[4][2] = 64;
a[4][3] = 128;
a[5][0] = 8;
a[5][1] = 512;
a[5][2] = 8;
a[5][3] = 512;
a[6][0] = 128;
a[6][1] = 4;
a[6][2] = 2;
a[6][3] = 8;
a[7][0] = 2;
a[7][1] = 1;
a[7][2] = 16;
a[7][3] = 4;
b = false;
e = -1;
}
private static boolean a(short word0)
{
if(a == -1)
{
int i1;
for(i1 = 0; i1 < 9; i1++)
if(a[i1][0] == word0)
{
a = i1;
b = 0;
return true;
}
if(i1 == 9)
return false;
}
if(a[a][b + 1] == word0)
{
b++;
if(b == 3)
{
m(a);
a = -1;
b = -1;
}
return true;
} else
{
a = -1;
b = -1;
return a(word0);
}
}
private static void m(int i1)
{
if(i1 == 8 && k == 18)
{
System.out.println("cheats enabled");
c = !c;
}
if(!c)
return;
i1;
JVM INSTR tableswitch 0 7: default 347
// 0 92
// 1 117
// 2 98
// 3 137
// 4 167
// 5 182
// 6 239
// 7 288;
goto _L1 _L2 _L3 _L4 _L5 _L6 _L7 _L8 _L9
_L1:
break; /* Loop/switch isn't completed */
_L2:
w.d = 8;
return;
_L4:
for(int j1 = 0; j1 < 4; j1++)
w.i[j1] = 1;
_L3:
for(int k1 = 0; k1 < 12; k1++)
w.h[k1] = 1;
break; /* Loop/switch isn't completed */
_L5:
b = !b;
if(b)
{
e = 0;
return;
} else
{
e = -1;
return;
}
_L6:
a = !a;
return;
_L7:
if(a.p != 1 || ((q) (a.a)).j != 35)
break; /* Loop/switch isn't completed */
a.a.a.E = 0;
a.a.a.a((short)0);
return;
JVM INSTR dup ;
Exception exception;
exception;
printStackTrace();
return;
_L8:
if(c() && !d)
return;
d = !d;
if(d)
{
j();
c = 0;
h(0);
return;
} else
{
j();
return;
}
_L9:
if(c() && !e)
return;
e = !e;
if(e)
{
j();
d = 0;
a(-1, d[d], 68, 1, -1);
return;
}
j();
}
private static void P()
{
Q();
a = new d();
a = new k();
a.a = 10;
a.a();
a.a(a, 0, 0, 1);
a = new s();
a.a = a;
a = new n();
a.a_ = 3;
}
private static void a(boolean flag)
{
if(flag)
{
a.drawRegion(b, 2, 0, 135, 416, 0, 6, 0, 20);
a.drawRegion(b, 6, 0, 131, 416, 2, 141, 0, 20);
}
a.drawImage(c, 166, 10, 17);
int i1 = f;
l l1;
int ai1[] = (l1 = a[17][0]).a[i1];
for(int j1 = l1.a[i1] - 1; j1 >= 0; j1--)
{
int k1;
int i2 = (k1 = ai1[j1]) & 0xff;
byte byte0 = (byte)(k1 >> 8 & 0xff);
byte byte1 = (byte)(k1 >> 16 & 0xff);
int j2 = k1 >> 24 & 0xff;
int k2 = 247 + byte0;
a[28].a(i2, k2, 127 + byte1, j2);
}
}
private static void Q()
{
short aword0[];
(aword0 = a[0])[0] = 359;
aword0[1] = -1;
aword0[2] = 362;
aword0[3] = 354;
aword0[4] = 355;
c[0] = 5;
(aword0 = a[1])[0] = 359;
aword0[1] = -1;
aword0[2] = 363;
aword0[3] = 364;
aword0[4] = 365;
aword0[5] = 366;
aword0[6] = 367;
aword0[7] = 368;
if(E != 0)
{
aword0[8] = 369;
aword0[9] = 405;
aword0[10] = 356;
c[1] = 11;
} else
{
aword0[8] = 405;
aword0[9] = 356;
c[1] = 10;
}
(aword0 = a[2])[0] = 359;
aword0[1] = 358;
aword0[2] = 370;
aword0[3] = 371;
aword0[4] = 372;
aword0[5] = 373;
aword0[6] = 374;
aword0[7] = 375;
aword0[8] = 376;
aword0[9] = 377;
c[2] = 10;
a[10][0] = 359;
a[10][1] = 358;
a[10][2] = 474;
a[10][3] = 475;
a[10][4] = 478;
c[10] = 5;
a[9][0] = 359;
a[9][1] = 358;
a[9][2] = 400;
a[9][3] = 489;
a[9][4] = 402;
a[9][5] = 490;
c[9] = 6;
a[3][0] = -1;
a[3][1] = 358;
a[3][2] = 381;
c[3] = 3;
a[4][0] = -1;
a[4][1] = 358;
a[4][2] = 382;
c[4] = 3;
a[5][0] = 359;
a[5][1] = -1;
a[5][2] = 383;
a[5][3] = 384;
a[5][4] = 385;
a[5][5] = 386;
a[5][6] = 387;
c[5] = 7;
a[6][0] = 359;
a[6][1] = -1;
a[6][2] = 388;
a[6][3] = 354;
a[6][4] = 355;
c[6] = 5;
a[13][0] = 359;
a[13][1] = -1;
a[13][2] = 459;
a[13][3] = 354;
a[13][4] = 355;
c[13] = 5;
a[7][0] = 357;
a[7][1] = 358;
a[7][2] = 389;
c[7] = 3;
a[8][0] = 361;
a[8][1] = 360;
a[8][2] = -1;
a[8][3] = -1;
c[8] = 4;
a[11][0] = -1;
a[11][1] = -1;
a[11][2] = 404;
c[11] = 3;
(aword0 = a[12])[0] = 359;
aword0[1] = 358;
aword0[2] = 7;
aword0[3] = 10;
aword0[4] = 4;
aword0[5] = 0;
aword0[6] = 3;
aword0[7] = 13;
aword0[8] = 15;
aword0[9] = 8;
c[12] = 10;
a[14][0] = (short)(E != 2 ? -1 : 361);
a[14][1] = 358;
a[14][2] = (short)(E != 2 ? '\u01EB' : 493);
c[14] = 3;
a[15][0] = 359;
a[15][1] = -1;
a[15][2] = 492;
a[15][3] = 354;
a[15][4] = 355;
c[15] = 5;
a[17][0] = -1;
a[17][1] = 358;
c[17] = 2;
}
public static final String b(int i1)
{
if(i1 < 0)
i1 = 0;
return "" + i1 / 10 + "" + i1 % 10;
}
private static void d(e e1)
{
switch(J)
{
case 0: // '\0'
e(e1);
return;
case 1: // '\001'
f(e1);
return;
case 2: // '\002'
g(e1);
return;
case 3: // '\003'
i(e1);
break;
}
}
private static void e(e e1)
{
E();
a(true);
short aword0[] = a[K];
a((byte)0, 0);
switch(K)
{
case 0: // '\0'
case 6: // '\006'
case 13: // '\r'
case 15: // '\017'
f(0);
a(aword0[2], o >> 1, p >> 1, (byte)6, e1, 0);
f(1);
if(L == 0)
f(0);
a(aword0[3], o >> 1, (p >> 1) + 45, (byte)6, e1, 0);
if(L == 0)
{
a.j = -(T >> 1) - 10;
a.k = 40;
}
f(1);
if(L == 1)
f(0);
a(aword0[4], o >> 1, (p >> 1) + 66, (byte)6, e1, 0);
if(L == 1)
{
a.j = -(T >> 1) - 10;
a.k = 61;
}
a.a(e1, false);
a.a(e1);
a(aword0[0], aword0[1], e1);
break;
}
}
private static void f(e e1)
{
E();
a(true);
short aword0[] = a[K];
a((byte)0, 0);
switch(K)
{
case 17: // '\021'
f(0);
a(405, o >> 1, 170, (byte)4, e1, 0);
int i1 = 200;
for(int k1 = 0; k1 < 8; k1++)
if(w.c[k1] > 0)
{
String s1;
a(s1 = a(370 + k1), 6, i1, (byte)0, e1, 0);
a(s1 = "" + w.c[k1], o - 6, i1, (byte)1, e1, 0);
i1 += 20;
}
a(aword0[0], aword0[1], e1);
return;
case 1: // '\001'
case 2: // '\002'
case 5: // '\005'
case 9: // '\t'
case 10: // '\n'
case 16: // '\020'
in⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -