⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 b.java

📁 J2ME游戏,FIFA2005 反编译后可运行
💻 JAVA
📖 第 1 页 / 共 5 页
字号:
			i2 = 0;
			j2 = 1;
			g1.setColor(0x77cc00);
			g1.fillRect(3, 2, 104, 29);
			g1.setColor(0);
			g1.fillRect(3, 16, 104, 1);
		} else {
			i2 = aU;
			j2 = aU ^ 1;
		}
		int k1 = aN[i2][8];
		int l1 = aN[j2][8];
		for (int k2 = 0; k2 < 13; k2++)
			Q[k2] = 32;

		for (int l2 = 0; l2 < 3; l2++) {
			a _tmp = bF;
			Q[l2] = src.a.w[i2][l2 + 1];
			a _tmp1 = bF;
			Q[l2 + 10] = src.a.w[j2][l2 + 1];
		}

		Q[5] = (byte) (k1 % 10 + 48);
		if (k1 >= 10)
			Q[4] = (byte) (k1 / 10 + 48);
		byte byte0 = 7;
		if (l1 >= 10) {
			Q[7] = (byte) (l1 / 10 + 48);
			byte0 = 8;
		} else if (cw || Y == 8)
			byte0 = 8;
		Q[byte0] = (byte) (l1 % 10 + 48);
		Q[byte0 + 13] = 0;
		if (cw || Y == 8) {
			a(g1, Q, 0, 3, 5, 4, 20);
			a(g1, Q, 10, 3, 5, 18, 20);
			a(g1, Q, 4, 2, 30, 4, 20);
			a(g1, Q, 7, 2, 30, 18, 20);
			if (bM > 0) {
				for (int i3 = 0; i3 < 10; i3++)
					if (n[i3] >= 0) {
						g1
								.setClip(45 + (i3 >> 1) * 11,
										5 + (i3 & 1) * 14, 9, 9);
						g1.drawImage(t, (45 + (i3 >> 1) * 11) - n[i3] * 9,
								5 + (i3 & 1) * 14, 20);
					}

			}
		} else {
			a(g1, Q, 0, 13, i1, j1, 20);
		}
	}

	private static void d(int ai1[], int i1, int j1) {
		ai1[0] = i1;
		ai1[6] = j1;
		ai1[4] = 0;
		ai1[3] = 0;
		a(ai1, W, Z);
		a(ai1[1], Q);
		for (int k1 = 0; k1 < 11; k1++) {
			a(am[i1][k1], ai1, k1);
			am[i1][k1][14] = Q[k1];
		}

	}

	private static void c(int ai1[], int i1) {
		a(ai1, W, Z);
		a(ai1[1], Q);
		for (int j1 = 0; j1 < 11; j1++)
			am[i1][j1][14] = Q[j1];

	}

	private static int b(int i1, int j1) {
		int j2;
		if (by[0] < 0x300000 && aN[i1][6] == 1 || by[0] > 0x300000
				&& aN[i1][6] == 0)
			j2 = j1 + 1;
		else
			j2 = j1 - 1;
		int i2;
		int l1 = i2 = -1;
		for (int k1 = 0; k1 < 11; k1++) {
			if (am[i1][k1][33] != 0)
				continue;
			if (am[i1][k1][14] == j2)
				l1 = k1;
			if (am[i1][k1][14] == j1)
				i2 = k1;
		}

		if (l1 == -1)
			l1 = i2;
		if (l1 == -1)
			l1 = 9;
		return l1;
	}

	private static void b(int ai1[][], int ai2[]) {
		int k1 = 0;
		if (ai2[4] == 12)
			k1 = 1;
		int l1 = ai2[0];
		int j1 = (ao << 1) + l1;
		byte abyte0[] = W[by[9]];
		byte abyte1[] = Z[by[10]];
		for (int i1 = 0; i1 < 11; i1++) {
			D[0] = (abyte0[(i1 << 2) + j1] & 0xff) << 16;
			D[1] = (abyte1[(i1 << 2) + j1] & 0xff) << 16;
			if (i1 != 0 && (ao != l1 || k1 == 1))
				b(D, k1);
			a(ai1[i1], ai2, D[0], D[1], 5);
		}

	}

	private static void a(int ai1[], int i1, boolean flag) {
		ai1[4] = i1;
		int i7 = ai1[0];
		int ai2[][] = am[i7];
		int j7 = 0;
		for (int j1 = 0; j1 < 11; j1++)
			if (ai2[j1][33] != 0)
				j7++;

		ai1[5] = j7;
		label0: switch (i1) {
		case 6: // '\006'
		default:
			break;

		case 0: // '\0'
			d();
			b(ai1);
			for (int k1 = 0; k1 < 11; k1++)
				if (ai2[k1][33] == 0) {
					a(ai2[k1], ai1, 0, 0, 0);
					a(ai2[k1], ai1[9 + k1 * 2 + 0], ai1[9 + k1 * 2 + 1]);
				}

			a(ai1);
			i7 = ai1[0];
			for (int l1 = 0; l1 < 11; l1++)
				if (ai2[l1][33] == 0)
					b(ai2[l1], ai1[9 + l1 * 2 + 0], ai1[9 + l1 * 2 + 1], l1);

			a(ai1, ao, true, false);
			aC[i7] = ai2[10];
			break;

		case 1: // '\001'
			a(ai1, ao, true, false);
			for (int i2 = 0; i2 < 11; i2++)
				if (ai2[i2][33] == 0)
					a(ai2[i2], ai1, 0, 0, 1);

			aC[i7] = ai2[10];
			break;

		case 2: // '\002'
			d();
			for (int j2 = 0; j2 < 11; j2++)
				a(ai2[j2], ai1, 0, 0, 4);

			if (ao == i7) {
				a(ai2[9], ai1, 0, 0, 9);
				a(ai2[10], ai1, 0, 0, 2);
				ai2[10][28] = 9;
				ai2[10][27] = 9;
				if (ao == 0)
					e = as = 9;
			}
			aC[i7] = ai2[10];
			break;

		case 3: // '\003'
			int k2 = ch;
			int l5 = e() & 0xff;
			int k7;
			int i8;
			if (l5 > 128) {
				k7 = ai2[k2][0] >> 16;
				i8 = ai2[k2][1] >> 16;
			} else {
				l5 = l5 * 48 >> 8;
				if (ai2[k2][0] < 0x300000)
					k7 = 1 + l5;
				else
					k7 = 95 - l5;
				i8 = 1;
				if (ai1[6] == 1)
					i8 = 160 - i8;
			}
			k7 = k7 + 0 << 16;
			i8 = i8 + 0 << 16;
			a(ai2[k2], ai1, k7, i8, 5);
			ai2[k2][4] -= k2;
			k2 = 5;
			do {
				if (k2 >= 11)
					break label0;
				if (ai2[k2][33] == 0) {
					a(ai2[k2], ai1, k7, i8, 5);
					ai2[k2][4] -= k2;
				}
				k2++;
			} while (true);

		case 4: // '\004'
			for (int l2 = flag ? 0 : 1; l2 < 11; l2++)
				a(ai2[l2], ai1, 0, 0, 4);

			break;

		case 7: // '\007'
			b(ai2, ai1);
			if (ao == i7) {
				int i3 = b(i7, 5);
				int i6 = by[0] >= 48 ? 0x20000 : 0xfffe0000;
				z = 0;
				a(ai2[i3], ai1, by[0] + i6, by[1], 14);
				aC[i7] = ai2[i3];
			}
			break;

		case 8: // '\b'
			int j6 = (ao << 1) + i7;
			a(ai1, ao, false, false);
			for (int j3 = 1; j3 < 11; j3++)
				a(ai2[j3], ai1, ai1[9 + j3 * 2 + 0], ai1[9 + j3 * 2 + 1], 5);

			if (ao == i7) {
				z = 0;
				int j8 = ai2[0][25] << 18;
				j8 = by[1] - j8;
				a(ai2[0], ai1, by[0], j8, 16);
				aC[i7] = ai2[0];
			}
			break;

		case 5: // '\005'
			a(ai1);
			for (int k3 = 0; k3 < 11; k3++) {
				a(ai2[k3], ai1, ai1[9 + k3 * 2 + 0], ai1[9 + k3 * 2 + 1], 24);
				ai2[k3][10] = 24;
			}

			b(ai1);
			break;

		case 9: // '\t'
			b(ai2, ai1);
			if (ao != i7)
				break;
			int l3 = b(i7, 5);
			z = 0;
			int l7 = by[0];
			if (l7 < 0x300000)
				l7 -= 0x20000;
			else
				l7 += 0x20000;
			a(ai2[l3], ai1, l7, by[1], 25);
			aC[i7] = ai2[l3];
			break;

		case 10: // '\n'
			int k6 = (ao << 1) + i7;
			a(ai1, ao, false, false);
			for (int i4 = 1; i4 < 11; i4++)
				a(ai2[i4], ai1, ai1[9 + i4 * 2 + 0], ai1[9 + i4 * 2 + 1], 5);

			if (ao != i7)
				break;
			int k8 = 10;
			if (ai1[6] == 0)
				k8 = 160 - k8;
			z = 0;
			a(ai2[0], ai1, 0x300000, k8 + 0 << 16, 27);
			aC[i7] = ai2[0];
			break;

		case 11: // '\013'
			b(ai2, ai1);
			if (ao != i7) {
				g(i7);
			} else {
				int j4 = b(i7, 5);
				z = 0;
				a(ai2[j4], ai1, by[0], by[1], 29);
				aC[i7] = ai2[j4];
			}
			break;

		case 12: // '\f'
			b(ai2, ai1);
			if (ao != i7)
				break;
			int k4 = b(i7, 9);
			int l8 = 0xfffe0000;
			if (ai1[6] == 0)
				l8 = -l8;
			a(ai2[k4], ai1, by[0], by[1] + l8, 31);
			aC[i7] = ai2[k4];
			break;

		case 15: // '\017'
			for (int l4 = 0; l4 < 11; l4++) {
				a(ai2[l4], ai1, 0, 0, 4);
				a(ai2[l4], 0xff9c0000, 0xff9c0000);
			}

			if (i7 == 0) {
				if (aR == 3) {
					int i5 = 6;
					for (int l6 = 0; i5 < 11; l6 += 51) {
						a(ai2[i5], ai1, 0, 0, 4);
						a(ai2[i5], 0x300000 + d[l6] * 20,
								0x500000 + d[l6 + 64 & 0xff] * 22);
						i5++;
					}

					a(ai2[10], 0);
					a(ai2[10], ai1, 0, 0, 10);
				} else {
					byte byte0;
					if (aR == 2)
						byte0 = 72;
					else
						byte0 = 48;
					a(ai2[10], ai1, 0, 0, 10);
					a(ai2[10], (byte0 + 0) - 6 << 16, 0x500000);
					if (aR == 2) {
						a(ai2[9], ai1, 0, 0, 4);
						a(ai2[9], 0x300000, 0x1a0000);
					}
				}
			} else if (aR == 3) {
				a(ai2[10], ai1, 0, 0, 4);
				a(ai2[10], 0x300000, 0x500000);
			}
			aC[i7] = ai2[10];
			bj = ai2[10][0];
			bs = ai2[10][1];
			break;

		case 13: // '\r'
			for (int j5 = 10; j5 >= 0; j5--)
				a(ai2[j5], ai1, 0, 0, 4);

			if (ae == i7)
				a(ai2[aT], ai1, 0xffec0000, 0x500000, 5);
			break;

		case 14: // '\016'
			a(ai2, ai1);
			if (ao == i7) {
				int k5 = b(i7, 9);
				a(ai2[k5], ai1, k5);
				ai2[k5][0] = 0x300000;
				ai2[k5][1] = 0x780000;
				a(ai2[k5], ai1, by[0], by[1] - 3, 31);
				aC[i7] = ai2[k5];
			}
			break;
		}
	}

	private static void c(int ai1[]) {
		a(ai1, ao, true, false);
		int j1 = ai1[0];
		for (int i1 = 0; i1 < 11; i1++) {
			if (am[j1][i1][33] != 0)
				continue;
			if (j1 == ao && i1 == 9)
				a(am[j1][i1], ai1[9 + i1 * 2 + 0], ai1[9 + i1 * 2 + 1]
						+ (4 * am[j1][i1][25] << 16));
			else
				a(am[j1][i1], ai1[9 + i1 * 2 + 0], ai1[9 + i1 * 2 + 1]);
			a(am[j1][i1], ai1, 0, 0, 4);
		}

		ai1[5] = 11;
	}

	private static void a(int ai1[], int ai2[], int i1) {
		for (int j1 = 0; j1 < 33; j1++)
			ai1[j1] = 0;

		ai1[11] = i1;
		ai1[17] = ai2[6];
		ai1[5] = 1 << (10 - i1) * 2 + ai2[0];
		if (ai1[17] == 1)
			ai1[25] = 1;
		else
			ai1[25] = -1;
	}

	private static void d() {
		v = u = f = ag = false;
		bV = e = as = -1;
		bu = 5;
		f = ag = false;
		ap = 5;
		bq = bi = false;
	}

	private static void a(int ai1[], int ai2[], int i1, int j1, int k1) {
		if (ai1[33] != 0)
			return;
		if (ai2[0] == 0 && (k1 == 20 || k1 == 21))
			k1 = 12;
		if (k1 == -1)
			k1 = 4;
		int l3 = k1 * 4;
		int l1 = ai1[11];
		ai1[9] = k1;
		ai1[16] = bI[l3 + 0];
		ai1[15] = bI[l3 + 1];
		ai1[10] = bI[l3 + 2];
		ai1[21] = 0;
		ai1[6] = 0;
		byte byte0 = bI[l3 + 3];
		if ((byte0 & 1) != 0)
			b(ai1, i1, j1, l1);
		if ((byte0 & 2) != 0)
			bk &= ~ai1[5];
		if ((byte0 & 4) != 0)
			ai2[5]++;
		if ((byte0 & 8) != 0)
			if (ai1[0] < 0x300000)
				ai1[26] = 8;
			else
				ai1[26] = 24;
		if ((byte0 & 0x10) != 0)
			if (ai1[17] == 0)
				ai1[26] = 16;
			else
				ai1[26] = 0;
		if ((byte0 & 0x20) != 0) {
			a _tmp = bF;
			ai1[21] = 18 - ((1 - src.a.T) * 18 >> 2);
		}
		if ((byte0 & 0x40) != 0)
			ai1[20] = bS;
		if (k1 == 4) {
			int i2 = by[0] - ai1[0] >> 16;
			int i3 = by[1] - ai1[1] >> 16;
			int i4 = i2 * i2 + i3 * i3;
			if (i4 < 9) {
				if (ai1[17] == 0)
					i4 = 4;
				else
					i4 = 0;
			} else {
				i4 = (a(i2, i3) + 16 & 0xe0) >> 5;
				if (i4 > 2 && i4 <= 6)
					i4 = 4;
				else
					i4 = 0;
			}
			ai1[26] = i4 << 2;
		}
		if (k1 == 1)
			if (ai2[0] == ao && ai1[11] == 9)
				b(ai1, ai2[9 + l1 * 2 + 0], ai2[9 + l1 * 2 + 1]
						+ (4 * ai1[25] << 16), ai2[0]);
			else
				b(ai1, ai2[9 + l1 * 2 + 0], ai2[9 + l1 * 2 + 1], ai2[0]);
		if (k1 == 24)
			b(ai1, ai2[9 + l1 * 2 + 0], ai2[9 + l1 * 2 + 1], ai2[0]);
		if (k1 == 18)
			b(ai1, by[0], by[1], ai2[0]);
		if (k1 == 37) {
			ai1[20] = 36;
			ai1[26] = 16;
		}
		if (k1 == 9)
			ai1[20] = 27;
		if (k1 == 10) {
			ai1[20] = 0;
			ai1[31] = 0;
			ai1[4] = 10000;
			ai1[28] = -1;
			ai1[27] = -1;
			ai1[29] = -1;
			ai1[13] = 1;
			ai1[2] = 0;
			bu = 5;
			bq = false;
			ap = 5;
			bi = false;
			f = false;
			ag = false;
			u = false;
			v = false;
			if (ai2[0] == 0) {
				ar &= 0xffffffef;
				ai1[16] = 84;
				bk &= ~ai1[5];
				ai1[3] = 0;
			} else {
				ai1[32] = (e() & 0xff) % 10;
				ai1[3] = ai1[25] * ai1[38] << 9;
				bk |= ai1[5];
			}
			ai1[22] = 0;
			ai1[23] = ai1[25] * 3 << 16;
			if (ai1[17] == 0)
				ai1[26] = 16;
			else
				ai1[26] = 0;
		}
		if (k1 == 12)
			if (ai2[0] == 0) {
				ai1[4] = 10000;
				if ((bk & ai1[5]) == 0) {
					ar &= 0xffffffef;
					ai1[16] = 84;
					bk &= ~ai1[5];
					ai1[2] = 0;
					ai1[3] = 0;
					if (ai1[17] == 0)
						ai1[26] = 16;
					else
						ai1[26] = 0;
				}
			} else {
				int ai3[] = aC[ai2[0] ^ 1];
				int j2;
				int j3;
				if ((bk & ai3[5]) != 0) {
					j2 = ai3[0] + (ai3[2] << 4);
					j3 = ai3[1] + (ai3[3] << 4);
				} else {
					j2 = ai3[0];
					j3 = ai3[1];
				}
				ai1[19] = ai3[26];
				b(ai1, j2, j3, ai2[0]);
			}
		if (k1 == 20 || k1 == 21 || k1 == 42) {
			int k2;
			int k3;
			if (k1 == 20 || k1 == 42) {
				if (by[11] == 0) {
					k2 = by[0] + (by[3] << 2);
					k3 = by[1] + (by[4] << 2);
				} else {
					k2 = by[0];
					k3 = by[1];
				}
			} else {
				int ai4[] = aC[ai2[0] ^ 1];
				if ((bk & ai4[5]) != 0) {
					k2 = ai4[0] + (ai4[2] << 4);
					k3 = ai4[1] + (ai4[3] << 4);
				} else {
					k2 = ai4[0];
					k3 = ai4[1];
				}
			}
			b(ai1, k2, k3, ai2[0]);
			ai1[4] = 100;
			ai1[19] = 40000;
			ai1[20] = 8;
		}
		if (k1 == 33) {
			bk |= ai1[5];
			int l2 = ai1[26] << 3;
			ai1[2] = d[l2] * ai1[38] >> 8;
			ai1[3] = d[l2 + 64 & 0xff] * ai1[38] >> 8;
			ai1[4] = 13;
		}
		if (k1 == 15) {
			by[11] = 1;
			by[0] = ai1[0];
			by[1] = ai1[1];
			by[2] = 0x48000;
			ai1[13] = 1;
		}
		if (k1 == 41) {
			int j4 = ai1[38];
			ai1[38] = ai1[38] * 3 >> 1;
			ai1[39] = ai1[39] = 32768 / ai1[38];
			b(ai1, i1, j1, ai1[11]);
			ai1[38] = j4;
			ai1[39] = ai1[39] = 32768 / ai1[38];
		}
	}

	private static void a(int ai1[], int i1, int j1) {
		ai1[0] = i1;
		ai1[1] = j1;
	}

	private static void b(int ai1[], int i1, int j1, int k1) {
		if (ai1[33] == 0) {
			int i2 = i1 - ai1[0] >> 16;
			int j2 = j1 - ai1[1] >> 16;
			int l1 = i2 * i2 + j2 * j2;
			int k2 = a(l1);
			l1 = a(i2, j2);
			ai1[4] = k2 * ai1[39] >> 8;
			ai1[2] = d[l1] * ai1[38] >> 7;
			ai1[3] = d[l1 + 64 & 0xff] * ai1[38] >> 7;
			ai1[6] = (e() & 3) << 2;
			ai1[26] = (l1 + 16 & 0xe0) >> 3;
			bk |= ai1[5];
		}
	}

	private static void c(int ai1[], int i1, int j1) {

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -