📄 b.java
字号:
by[3] = d[i1] * j1 >> 7;
by[4] = d[i1 + 64 & 0xff] * j1 >> 7;
by[5] = 0;
x = 5;
ck = ai1[5];
ai1[13] = 0;
by[11] = 0;
d();
}
private static boolean a(int ai1[], int i1, int j1, boolean flag) {
int k2 = bu;
bu = 5;
bq = false;
boolean flag3 = cc == 18 || cc == 19;
boolean flag1;
if (flag3 || flag || i1 == 1 && (e() & 1) == 1)
flag1 = false;
else
flag1 = k2 < 30;
int i2;
int l2;
boolean flag2;
if (flag3) {
i2 = cA[cu] + 128 * aN[ao ^ 1][6];
if ((e() & 0xff) < 128 && k2 > 52)
i2 += (cu - 1) * (k2 >> 2);
i2 &= 0xff;
flag2 = false;
l2 = 0;
} else {
int k1 = 48 - (ai1[0] >> 16);
if (k1 > 0)
k1 += j1;
else
k1 -= j1;
int l1;
if (ai1[17] == 0)
l1 = -(ai1[1] >> 16);
else
l1 = 160 - (ai1[1] >> 16);
l2 = a(l1 * l1 + k1 * k1);
flag2 = l1 < -100 || l1 > 100;
i2 = a(k1, l1);
int j2 = i2 - (ai1[26] << 3);
if (j2 < 0)
j2 = -j2;
if (j2 > 128)
j2 = 256 - j2;
if (!flag && j2 > 64 || flag2)
i2 = ai1[26] << 3;
}
if (flag2) {
k2 = 0;
} else {
a _tmp = bF;
src.a.aA[2 + i1]++;
}
if (flag3)
c(ai1, i2, (ai1[37] * ((k2 << 16) / 70) >> 16) + 1);
else if (flag2)
c(ai1, i2, ai1[37] >> 1);
else
c(ai1, i2, ai1[37]);
if (by[2] < 0x20000)
by[5] = 0x11000;
if (flag3) {
if (ac != 0)
by[5] = 0x15000 + (k2 << 8);
if ((e() & 0xff) < 168 && k2 > 52)
by[5] += 8192 + k2 << 3;
} else if (flag1 || flag2) {
int i3 = (l2 << 6) >> 4;
int j3 = (l2 << 14) / i3;
j3 += 768;
int k3 = j3 * 12288 >> 9;
if (flag2)
k3 = k3 * 3 >> 1;
by[5] = k3 + (k3 >> 4);
}
by[12] = 0;
return true;
}
private static boolean a(int ai1[], int i1, int ai2[]) {
int j1 = ai1[0];
int k1 = ai1[1];
int j2 = ai2[0];
int k2 = ai2[1];
int j3 = a(6400 - ((by[1] >> 16) - 80) * ((by[1] >> 16) - 80)) >> 2;
int k3 = ai1[17] != 0 ? 160 : 0;
int i3 = a(48 - (ai2[0] >> 16), k3 - (ai2[1] >> 16));
int l2 = j3 * d[i3];
i3 = j3 * d[i3 + 64 & 0xff];
k3 = a((l2 + j2) - j1 >> 16, (i3 + k2) - k1 >> 16);
int l1 = d[k3 & 0xff];
int i2 = d[k3 + 64 & 0xff];
int l3 = ((j2 - j1) + l2 >> 16) * l1 + ((k2 - k1) + i3 >> 16) * i2;
a(ai2, aN[i1], l1 * ((l3 >> 16) + 2) + j1, i2 * ((l3 >> 16) + 2) + k1,
41);
int i4 = ai2[4];
if (i4 < 5)
i4 = 5;
ai2[20] = 50;
int j4 = (l3 / (i4 << 16)) * 8 + 15 & 0xff;
j4 += (l3 >> 1) * (l3 >> 17) * 3 >> 1 >> 16;
j1 = ai1[37] * 7 >> 2;
if (j4 > j1)
j4 = j1;
if (j4 < 150)
j4 = 150;
c(ai1, k3, j4);
by[12] = 1;
return true;
}
private static void a(int ai1[], int i1, int j1, int k1) {
int j3 = bu;
ap = 5;
bi = f = u = false;
boolean flag1 = j1 < 0;
if (ao == 1)
bW = -1;
int ai2[] = am[i1][k1];
int l1 = ai2[0] - by[0] >> 16;
int i2 = ai2[1] - by[1] >> 16;
int j2 = a(l1, i2);
l1 = l1 * l1 + i2 * i2;
int l2 = 0;
boolean flag = false;
if (l1 > 400 || flag1) {
int k2 = a(l1);
if (flag1) {
j1 = (k2 << 6) >> 4;
if (j1 < 4)
j1 = 4;
if (j1 > 150)
j1 = 150;
}
int i3 = (k2 << 14) / j1;
if (flag1) {
i3 += 768;
j1 <<= 1;
}
l2 = i3 * 12288 >> 9;
}
c(ai1, j2, j1);
by[5] = l2;
if (cc == 21 && flag1)
l2 = 37;
else
l2 = 9;
a(ai2, aN[i1], 0, 0, l2);
by[12] = 1;
}
public static void a(byte abyte0[], int i1, byte abyte1[], int j1,
boolean flag) {
int k1 = i1 * 307;
aN[j1][1] = abyte0[k1 + 0];
aN[j1][2] = abyte0[k1 + 1];
int k2;
if (j1 == 0) {
a _tmp = bF;
k2 = (src.a.T - 1) * 12;
a _tmp1 = bF;
if (src.a.T == 2)
k2 += 8;
} else {
if (flag) {
int i2 = aN[1][8] - aN[0][8];
aN[1][2] += i2;
if (aN[1][2] < 0)
aN[1][2] = 0;
if (aN[1][2] > 10)
aN[1][2] = 10;
}
k2 = 0;
}
k1 += 7;
for (int j2 = 0; j2 < 11; j2++) {
int ai1[] = am[j1][j2];
int l2;
if (abyte1 == null)
l2 = j2;
else
l2 = abyte1[j2];
int l1 = k1 + l2 * 20;
if (j1 == 0) {
a _tmp2 = bF;
ai1[34] = src.a.A[l2];
if (ai1[34] == 2)
ai1[33] = 1;
else
ai1[33] = 0;
}
ai1[41] = l2;
a _tmp3 = bF;
System.arraycopy(abyte0, l1, src.a.R[11 * j1 + j2], 0, 16);
char c1;
if (j2 == 0)
c1 = 'd';
else
c1 = '\200';
ai1[35] = 11 * j1 + j2;
ai1[37] = (170 - k2) + ((abyte0[l1 + 16] & 0xf) << 7) / 10;
ai1[36] = abyte0[l1 + 16] >> 4 & 0xf;
ai1[38] = (c1 - k2) + ((abyte0[l1 + 17] & 0xf) << 5) / 10 >> 1;
if (j1 == 1 && w[1])
ai1[38] = 1;
ai1[39] = 32768 / ai1[38];
ai1[40] = 64 + ((abyte0[l1 + 18] >> 4 & 0xf) << 7) / 10;
}
}
public static void a(int i1, int j1, int k1, int l1) {
aZ = i1;
aP = 0;
bJ = 0;
aU = l1;
cw = false;
int k2 = j1 << 1;
int l2 = k1 << 1;
if (al.charAt(k2) == al.charAt(l2))
l2 ^= 1;
if (al.charAt(k2) == al.charAt(l2))
k2 ^= 1;
m = k2;
L = l2;
int i2 = j1 * 307;
int j2 = k1 * 307;
aN[0][8] = 0;
aN[1][8] = 0;
}
private static Image a(byte abyte0[], byte abyte1[], int i1, int j1) {
int k1 = abyte1[4] & 0xff | (abyte1[5] & 0xff) << 8;
System.arraycopy(abyte1, 8 + k1 * j1, abyte0, abyte1[0] & 0xff
| (abyte1[1] & 0xff) << 8, k1);
return Image.createImage(abyte0, 0, i1);
}
public static void h(int i1) {
aN[2][1] = i1;
aN[2][6] = 0;
a(aN[2], 0, false, true);
}
public static void c(int i1) {
ar = 0;
Y = i1;
switch (i1) {
case 2: // '\002'
default:
break;
case 0: // '\0'
bQ = (int) System.currentTimeMillis();
cc = 0;
break;
case 3: // '\003'
if (aZ == 2) {
a _tmp = bF;
src.a.e(23, 0);
break;
}
if (aZ == 3) {
a _tmp1 = bF;
src.a.e(24, 0);
} else {
a _tmp2 = bF;
src.a.e(22, 0);
}
break;
case 1: // '\001'
case 4: // '\004'
cr = 20;
break;
case 5: // '\005'
case 8: // '\b'
bA = 68;
if (bm) {
bk = 0;
for (int j1 = 0; j1 < 17; j1++)
by[j1] = 0;
by[0] = 0x300000;
by[1] = 0x500000;
a _tmp3 = bF;
byte byte0;
switch (src.a.q) {
case 0: // '\0'
default:
byte0 = 3;
break;
case 1: // '\001'
byte0 = 5;
break;
case 2: // '\002'
byte0 = 10;
break;
}
if (w[0])
V = 10;
bS = 0;
int i3;
if (aV) {
i3 = 0;
ao = 0;
bz = false;
byte0 = 15;
} else {
ao = aP ^ aU;
i3 = ao ^ 1;
byte0 = 0;
}
d(aN[0], 0, i3);
d(aN[1], 1, i3 ^ 1);
a(aN[0], byte0, true);
a(aN[1], byte0, true);
if (aV) {
bR = true;
cd = false;
cI = false;
cc = 21;
byte byte1;
if (aR == 2)
byte1 = 72;
else
byte1 = 48;
for (int k1 = 0; k1 < 4; k1++) {
bY[k1][0] = byte1 + 0 << 16;
bY[k1][1] = 80 - k1 * 12 - 6 << 16;
}
if (aR == 3)
aM = 1800;
else
aM = 0;
E = 31;
cm = 0;
K = 1;
g = 0;
bf = bt[aR];
cF = 0;
bT = 0;
bZ = 1;
aV = false;
bj = 0x300000;
bs = 0xa00000;
} else {
cd = true;
cI = true;
if (i1 == 8) {
bQ = 0;
bM = 0;
for (int l1 = 0; l1 < 10; l1++)
n[l1] = -1;
ca[0] = ca[1] = 10;
cw = true;
cc = 11;
} else {
C = 1;
cc = 1;
bR = false;
}
}
ay = 0x40000000;
ai = 0;
bW = -1;
x = 1000;
ck = -1;
i = -1;
z = 0;
bC = 0;
cJ = 0;
ci = 1;
cb = 0;
for (int i2 = 0; i2 < 11; i2++) {
aJ[0][i2] = -1;
aJ[1][i2] = -1;
br[i2] = -1;
H[i2] = -1;
}
for (int j2 = 0; j2 < 8; j2++)
S[j2] = 0;
for (int k2 = 0; k2 < 32; k2++)
bL[k2] = 0;
for (int l2 = 0; l2 < 384; l2++) {
cv[0][l2] = 0;
cv[1][l2] = 0;
}
bm = false;
cB = true;
} else {
c(aN[0], 0);
c(aN[1], 1);
}
aF = (int) System.currentTimeMillis() - bS * V;
break;
case 6: // '\006'
y = 6;
bX = 3;
if (aP == 1)
bJ++;
aP ^= 1;
bm = true;
c(1);
break;
case 7: // '\007'
bX = 2;
y = 7;
c(1);
break;
}
}
public static void f(int i1) {
a _tmp = bF;
if (src.a.n == 0)
return;
if (cx[i1] != null) {
try {
if (cC < 0 || cx[cC].getState() != 400) {
if (cC >= 0)
cx[cC].deallocate();
cx[i1].prefetch();
cx[i1].setLoopCount(1);
cx[i1].start();
}
} catch (Exception exception) {
}
cC = i1;
}
}
private static void b(int i1) {
if (cc == 21 && aC[0][9] == 10)
return;
bZ = 0;
h();
d();
bz = false;
if (cc == 21) {
if (aC[0][11] != 10) {
aC[0] = am[0][10];
a(aC[0], aN[0], 0, 0, 12);
}
bR = false;
bT = 18;
}
int j1 = (by[0] >> 16) - 48;
if (i1 != 1 && j1 > -8 && j1 < 8 && by[2] < 0x60000) {
if (cc == 21) {
by[3] = by[4] = by[5] = 0;
cF++;
} else {
d(i1);
if (cw)
if (bM > 10) {
if (n[8 + (bM - 1 & 1)] == -1)
n[8 + (bM - 1 & 1)] = 1;
} else if (n[bM - 1] == -1)
n[bM - 1] = 1;
}
} else if (cc != 21) {
bg = i1;
System.arraycopy(by, 0, by, 6, 3);
bQ = 30;
cc = 5;
a(aN[0], 4, false);
a(aN[1], 4, false);
if (cw) {
if (bM > 10) {
if (n[8 + (bM - 1 & 1)] == -1) {
n[8 + (bM - 1 & 1)] = 0;
f(2);
}
} else if (n[bM - 1] == -1) {
n[bM - 1] = 0;
f(2);
}
} else {
f(2);
}
}
}
private static void d(int i1) {
int j1 = ao;
if (by[14] == 1)
j1 ^= 1;
int k1;
if (i1 == 2) {
by[1] -= 0x24000;
k1 = 1;
} else {
by[1] += 0x24000;
k1 = 0;
}
k1 ^= aN[0][6];
ao = k1;
by[3] = by[4] = by[5] = 0;
f(0);
a _tmp = bF;
src.a.aA[k1 ^ 1]++;
if (j1 != k1) {
a _tmp1 = bF;
src.a.aA[4 + (k1 ^ 1)]++;
}
aN[k1 ^ 1][8]++;
ch = P;
if (cw) {
bQ = 36;
cc = 11;
} else {
bA = 68;
byte byte0;
if (j1 == k1) {
cc = 7;
byte0 = 4;
} else {
cc = 6;
byte0 = 3;
}
bQ = 36;
a(aN[k1 ^ 1], byte0, false);
a(aN[k1], 4, false);
}
}
private static void e(int i1) {
by[3] = by[4] = by[5] = 0;
if (!cw)
System.arraycopy(by, 6, by, 0, 3);
int j1 = ao;
if (i1 == 1) {
if (cw) {
bQ = 18;
cc = 11;
} else {
ao = j1 ^ 1;
a(aN[0], 7, false);
a(aN[1], 7, false);
cc = 14;
if (by[8] > 0x30000)
by[2] = 0x30000;
}
} else {
int k1;
if (i1 == 2)
k1 = 1;
else
k1 = 0;
k1 ^= aN[0][6];
ao = k1;
int i2 = (by[0] >> 16) - 48;
byte byte0;
int l1;
int j2;
if (k1 == j1) {
f(1);
ao = k1 ^ 1;
if (i2 < 0)
byte0 = 0;
else
byte0 = 94;
l1 = 159;
i2 = 12;
j2 = 28;
} else {
i2 = 12;
j2 = 16;
byte0 = 48;
l1 = 153;
}
if (i1 == 2) {
l1 = 160 - l1;
j2 = 32 - j2;
}
if (cw) {
bQ = 18;
cc = 11;
} else {
by[0] = byte0 + 0 << 16;
by[1] = l1 + 0 << 16;
by[2] = 0;
by[9] = i2;
by[10] = j2;
if (k1 == j1) {
a _tmp = bF;
src.a.aA[6 + (k1 ^ 1)]++;
a(aN[0], 9, false);
a(aN[1], 9, false);
cc = 16;
} else {
a(aN[0], 8, false);
a(aN[1], 8, false);
cc = 15;
}
}
}
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -