📄 b.java
字号:
j2 = 256 - j2;
if (j2 > 64 && i7 >= 225)
continue;
k2 = k2 + 4 >> 3 & 0x1f;
j3 = 128 - j2;
if (k3 == 0) {
if (bL[k2] == 0 && bL[k2 + 1 & 0x1f] == 0
&& bL[k2 - 1 & 0x1f] == 0)
j3 += 20;
if (i7 < 1600) {
if (j3 > l5) {
l5 = j3;
aC[k3][28] = l1;
v = j2 <= 64;
}
continue;
}
if (j3 > i6 && ai1[0] > 0 && ai1[1] > 0) {
i6 = j3;
aC[k3][27] = l1;
}
continue;
}
l3 = (ai1[0] >> 16) - 4 >> 3;
i4 = (ai1[1] >> 16) - 4 >> 3;
if (l3 < 0 || i4 < 0)
continue;
l3 = (i4 << 4) + l3;
j2 = k3 ^ 1;
j2 = cv[j2][l3] + cv[j2][l3 + 1] + cv[j2][l3 + 16]
+ cv[j2][l3 + 17];
j2 = 4 - j2 << 6;
if (j2 <= k1 || bL[k2] != 0 || bL[k2 + 1 & 0x1f] != 0
|| bL[k2 - 1 & 0x1f] != 0)
continue;
if (k2 < 2500) {
if (j3 > l5) {
l5 = j3;
aC[k3][28] = l1;
}
continue;
}
if (j3 > i6) {
i6 = j3;
aC[k3][27] = l1;
}
continue;
}
if (l1 != 0 && ai1[21] == 0 && k2 < l4) {
l4 = k2;
j6 = l1;
}
continue;
}
if (k2 < i5)
i5 = k2;
if (l1 != 0 && ai1[21] == 0)
if (i4 * ai1[25] < 0) {
if (k2 < j5) {
j5 = k2;
k6 = l1;
}
} else if (k2 < k5) {
k5 = k2;
l6 = l1;
}
if ((j2 = H[l1]) >= 0) {
H[l1] = -1;
cb -= B[j2];
S[j2]--;
}
if ((j2 = br[l1]) >= 0) {
br[l1] = -1;
bL[j2]--;
}
if (k2 >= 900)
continue;
j2 = a(l3, i4) + 4 >> 3 & 0x1f;
bL[j2]++;
br[l1] = j2;
if (k2 < 144) {
int l2 = l3 + 2 >> 2 & 7;
cb += B[l2];
S[l2]++;
H[l1] = l2;
}
}
}
if (cc == 12) {
int i2;
int i3;
if (O) {
i3 = 20;
if (j5 < k5)
i2 = k6;
else
i2 = l6;
if (by[12] == 0)
c(ao, j6, i3);
} else {
if (aC[ao][17] == 0)
i3 = aC[ao][1] >> 16;
else
i3 = 160 - (aC[ao][1] >> 16);
i2 = -1;
if (i3 < 40) {
i2 = k6;
i3 = 12;
}
if (i2 == -1)
if (k5 < j5 >> 2) {
i3 = 21;
i2 = l6;
} else {
i3 = 12;
i2 = k6;
}
}
if (ao == 0)
c(ao ^ 1, i2, i3);
}
aC[ao][18] = i5;
}
private static void o() {
int l3 = by[0];
int i4 = by[1];
if (cc == 21) {
int j2 = aC[0][0] + aC[0][2] >> 16;
int i3 = aC[0][1] + aC[0][3] >> 16;
if (j2 < 0 || j2 > 96 || i3 < 0 || i3 > 160) {
aC[0][16] = 84;
bk &= ~aC[0][5];
}
}
int i2 = bk;
for (int i1 = 10; i1 >= 0; i1--) {
for (int j1 = 0; j1 < 2; j1++) {
int ai1[] = am[j1][i1];
if (ai1[33] != 0) {
int k2 = ai1[0] >> 16;
int j3 = ai1[1] >> 16;
System.out.println("x " + k2 + " y:" + j3);
if (k2 < -50 || k2 > 146 || j3 < -50 || j3 > 210) {
i2 >>= 1;
continue;
}
}
if ((i2 & 1) != 0) {
ai1[0] += ai1[2];
ai1[1] += ai1[3];
}
if (ai1[9] == 10) {
by[0] = ai1[0] + (ai1[22] >> 1);
by[1] = ai1[1] + (ai1[23] >> 1);
by[2] = 0;
}
if (O) {
int l2 = ai1[0] - l3 >> 8;
int k3 = ai1[1] - i4 >> 8;
if (l2 >= -384 && l2 <= 384 && k3 >= -384 && k3 < 384) {
int k1;
int l1;
if (ai1[11] == 0) {
k1 = d[ai1[8]] * aX + 0x30000 & 0x3fffffff;
if (aX - 3 <= 0)
l1 = 0;
else
l1 = d[ai1[8]] * (aX - 3) & 0x3fffffff;
if (l1 < 0)
l1 = -l1;
} else {
k1 = (d[ai1[8]] << 1) + 0x30000;
l1 = 0;
}
if (bR && ai1[5] != ck && by[2] <= k1 && ai1[21] == 0)
if (ai1[11] == 0) {
if (by[2] >= l1) {
if (ai1[9] != 39 && ai1[9] != 40)
a(ai1, aN[j1], 0, 0, 4);
if (ao != j1) {
a _tmp = bF;
src.a.aA[4 + (j1 ^ 1)]++;
}
ai1[19] = 0;
a(ai1, j1);
if (cc == 20 || cc == 11)
b(1);
by[3] = by[4] = by[5] = 0;
}
} else {
O = a(ai1, j1);
}
}
}
i2 >>= 1;
}
}
}
private static void g() {
bp = by[0];
cy = by[1];
boolean flag3 = false;
if (aq > 0)
aq--;
cz = -1;
boolean flag2 = false;
O = by[11] == 0;
c();
if (cc != 12)
aF = (int) System.currentTimeMillis() - bS * V;
if (cc >= 12) {
if (cc == 19 || cc == 18)
b();
if (x-- <= 0) {
x = 1000;
ck = -1;
}
int i1;
int l2;
if (cc == 13 || cc == 15 || cc == 16) {
i1 = by[9];
l2 = by[10];
} else {
i1 = (((by[0] >> 16) - 0) * 192) / 96 >> 3;
l2 = ((by[1] >> 16) - 0 << 8) / 160 >> 3;
}
byte byte2 = 0;
if (i1 < 0) {
i1 = 0;
byte2 = 1;
}
if (i1 > 23) {
i1 = 23;
byte2 = 1;
}
if (l2 < 0) {
l2 = 0;
byte2 = 2;
}
if (l2 > 31) {
l2 = 31;
byte2 = 3;
}
if (bZ == 1) {
if (byte2 != 0) {
if (cc == 21 && l2 == 31)
byte2 = 1;
b(byte2);
}
} else if (byte2 == 0 && cc == 12)
bZ = 1;
int k11 = bv[i1] | bH[l2];
byte abyte0[] = W[i1];
byte abyte1[] = Z[l2];
int l8 = (l2 << 8) + i1;
if (cc != 16 && cc != 17 && cc != 18 && cc != 15 && cc != 13
&& cc != 21 && !cw) {
int i5 = 0;
int l5 = (ci << 2) + (ao << 1);
for (; i5 < 2; i5++) {
int ai5[] = am[i5][ci];
if (ai5[15] == 0 && ai5[7] != l8) {
ai5[7] = l8;
a(ai5, aN[i5], (abyte0[l5] & 0xff) << 16,
(abyte1[l5] & 0xff) << 16, 5);
}
l5++;
}
ci++;
if (ci > 10)
ci = 1;
}
if (cc != 21) {
int j4 = by[13];
am[j4 ^ 1][0][19] = 0;
int ai6[] = am[j4][0];
if (ai6[9] == 40) {
j--;
if (j <= 0) {
a(ai6, aN[j4], 0, 0, 4);
bk &= ~ai6[5];
}
}
if (ai6[15] == 0)
if (cc != 18 && cc != 19) {
int i6 = j4 ^ 1;
boolean flag1 = false;
if (aC[i6][13] == 1) {
int i12 = ai6[0] - aC[i6][0] >> 16;
int i14 = ai6[1] - aC[i6][1] >> 16;
i12 = i12 * i12 + i14 * i14;
if (i12 < 9) {
ai6[19] = 0;
aC[i6][13] = 0;
a(aC[i6], aN[i6], 0, 0, 4);
a(ai6, j4);
flag1 = true;
}
}
if (!flag1) {
byte byte0 = 48;
char c1;
if (aN[j4][6] == 1)
c1 = '\002';
else
c1 = '\236';
if (O) {
if (ai6[19] == 0) {
int j6 = by[4] * ai6[25];
if (j6 < 0 || cc == 11 || cc == 20) {
int k5 = (ai6[1] - (c1 << 16)) + 3 >> 2;
int j12 = ai6[0];
int j14 = c1 << 16;
int j11 = 0;
do {
if (j11 >= 5)
break;
if (by[4] >> 4 != 0)
j6 = (j14 - by[1])
/ (by[4] >> 4);
else
j6 = 0;
j12 = by[0] + (by[3] * j6 >> 4);
if (j12 > 0x380000)
j12 = 0x380000;
if (j12 < 0x280000)
j12 = 0x280000;
int j5 = j12 - ai6[0] >> 16;
int i9 = j14 - ai6[1] >> 16;
i9 = j5 * j5 + i9 * i9;
i9 = a(i9);
if (j11 == 0) {
bE = j12;
ak = i9;
}
i9 = (i9 << 11) / ai6[38];
if (j11 == 0)
cl = i9;
if (i9 <= j6)
break;
j14 += k5;
j11++;
} while (true);
int j9 = ((j14 >> 16) << 8)
+ (j12 >> 16);
ai6[7] = j9;
j6 >>= 4;
k5 = by[2] + by[5] * j6
+ (-12288 * j6 * j6) / 2;
if (k5 < 0)
k5 = 0;
if ((ak == 1 && (e() & 0xff) < 128 || j6 > 10)
&& k5 <= 0x30000) {
a(ai6, aN[j4], j12, j14, 5);
ai6[19] = 2;
} else {
ai6[19] = 1;
}
} else {
ai6[19] = 2;
}
} else if (ai6[19] == 1 && ai6[9] != 39
&& ai6[9] != 40) {
if (aN[j4][6] == 1)
c1 = '\002';
else
c1 = '\236';
if (by[4] >> 4 != 0)
aw = ((c1 << 16) - by[1])
/ (by[4] >> 4);
else
aw = 0;
int k6 = by[4] * ai6[25];
if (k6 < 0 && cl + 5 > aw)
if (ai6[0] - bE >> 16 < 20) {
int j16;
if (bE - ai6[0] < 0) {
j16 = -(bE - ai6[0]);
s = 0;
} else {
j16 = bE - ai6[0];
s = 1;
}
if (j16 >> 16 <= 20
&& j16 >> 16 >= 0
&& bE != 0) {
ai6[8] = 255;
aX = by[2] >> 16 <= 0 ? 0
: (by[2] >> 16) + 4;
if (by[5] >> 16 > 2)
aX += 6;
if (aX > 14)
aX = 14;
I = 0;
j = 18;
a(ai6, aN[j4], bE, ai6[1], 39);
if (ai6[4] > 5)
aB = 256 / (ai6[4] - 2);
else
aB = 32;
ai6[19] = 2;
}
} else {
a(ai6, aN[j4], bE, ai6[1], 5);
}
}
int l6 = by[4] * ai6[25];
if (l6 >= 0 && ai6[9] != 39 && ai6[9] != 40
&& cc != 20 && cc != 11)
c(ai6, j4, byte0, c1);
} else {
ai6[20] = 0;
ai6[19] = 0;
c(ai6, j4, byte0, c1);
}
}
} else if (ai6[17] == 0)
ai6[26] = 16;
else
ai6[26] = 0;
}
bW--;
if (ao != 0) {
if ((ar & 0x10) != 0 || bo) {
if (bW < 0 || bo)
l();
if (cc == 12) {
c(0, h[aA], 20);
aA++;
if (aA > bh)
aA = 1;
}
}
ar &= 0xffffffef;
bo = false;
}
int i11 = 0;
int l11 = -1;
int l10 = 1000;
for (int k4 = 0; k4 < 2; k4++) {
int k10 = -1;
int ai7[] = aC[k4];
switch (ai7[9]) {
case 10: // '\n'
by[11] = 1;
if (k4 == 0) {
if ((ar & 0x20) != 0 && cd) {
ag = true;
bu += 5;
if (bu > 70)
bu = 70;
} else if (bu > 5)
bq = true;
if (cc == 21
&& (aR == 2 && bV == -1 || aR == 3 && e == -1
&& as == -1))
ar &= 0xffffffef;
if ((ar & 0x10) != 0 && cI) {
f = true;
ap += 5;
if (ap > 70)
ap = 70;
} else if (ap > 5)
bi = true;
if (!ag && !f) {
e = as = bV = -1;
u = false;
}
cz = ai7[11];
a(ai7, true);
ai7[31]++;
l11 = ai7[11];
l10 = 0;
if (!f && !ag) {
int j1 = (ai7[0] >> 16) - 48;
int i3 = (ai7[1] >> 16) - 0;
if (aN[k4][6] == 1)
i3 = 160 - i3;
if (i3 < 60 && (j1 < -30 || j1 > 30)
&& ai7[29] != -1) {
as = bV = ai7[29];
e = -1;
} else {
e = ai7[28];
as = ai7[27];
}
if ((i3 < 60 && (j1 >= -30 || j1 <= 30) || i3 > 60
&& i3 < 80)
&& e != -1 && v)
u = true;
}
if (bi && cI) {
if (e != -1 || as != -1 || bV != -1) {
char c2 = '\310';
boolean flag4 = false;
if (ap < 30) {
if (k4 == 0 && cc != 21 && u && e != -1) {
int k16 = e;
a(ai7, k4, am[k4][k16]);
aC[k4] = am[k4][k16];
} else {
int l16;
if (bV != -1) {
c2 = '\uFFFF';
l16 = bV;
} else if (e != -1)
l16 = e;
else
l16 = as;
a(ai7, k4, c2, l16);
aC[k4] = am[k4][l16];
}
} else {
int i17;
if (bV != -1) {
c2 = '\uFFFF';
i17 = bV;
} else if (as != -1)
i17 = as;
else
i17 = e;
a(ai7, k4, c2, i17);
aC[k4] = am[k4][i17];
}
k10 = 4;
if (cc == 21)
bk &= ~ai7[5];
} else if (ai7[31] > 4 && cc != 21) {
c(ai7, ai7[26] << 3, 128);
k10 = 20;
}
ar &= 0xffffffef;
} else if (cd && bq) {
a(ai7, k4, 4, false);
bz = true;
bo = true;
if (cc == 21)
k10 = 12;
else
k10 = 20;
if (cc == 21) {
bk &= ~ai7[5];
if (ai7[1] > 0xa00000)
ai7[1] = 0xa00000;
}
ar &= 0xffffffdf;
}
} else {
if (ai7[20] > 0)
ai7[20]--;
int k1 = cb;
if (k11 != 0)
k1 += 100;
int j3 = ai7[18];
if (j3 < 100) {
k1 += 100 - j3;
if (k1 > 256)
k1 = 256;
}
k1 = (k1 * ai7[36]) / 10;
l10 = 256 - k1;
int i7;
if (k4 == 0)
i7 = (ai7[11] << 2) + 0;
else
i7 = (ai7[11] << 2) + 3;
int k9;
if (ai7[17] == 0)
k9 = (ai7[1] >> 16) - 0;
else
k9 = 160 - (ai7[1] >> 16);
if (k9 > 30)
k1 = ai7[0] - ((abyte0[i7] & 0xff) << 16) >> 16;
else
k1 = (ai7[0] >> 16) - 48;
if (ai7[17] == 0) {
if (k1 > -13 && k1 < 13)
i7 = 4;
else if (k1 < 0)
i7 = 3;
else
i7 = 5;
} else if (k1 > -13 && k1 < 13)
i7 = 0;
else if (k1 < 0)
i7 = 1;
else
i7 = 7;
k1 = (ai7[0] >> 16) - 48;
if (k1 < 0)
k1 = -k1;
ai7[31]++;
if (ai7[31] > 1) {
l11 = ai7[11];
if (k1 < 24 && k9 < 24 - ai7[32]) {
if (a(ai7, k4, 4, false))
k10 = 4;
} else if (ai7[28] != -1 && ai7[31] > 20) {
a(ai7, k4, 188, ai7[28]);
aC[k4] = am[k4][ai7[28]];
k10 = 4;
bW = -1;
} else if (j3 < 144 && ai7[20] == 0) {
int l1 = ai7[26] >> 2;
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -