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

📄 a.java

📁 J2ME游戏,FIFA2005 反编译后可运行
💻 JAVA
📖 第 1 页 / 共 3 页
字号:
						src.b.V = 10;
					}
				} else {
					aD[i2] = 0;
				}

		}
		int j1 = d(an, 2);
		if ((i1 & 0x50) != 0)
			b(an, j1 + 10);
		if ((i1 & 0x20) != 0)
			b(an, j1 + 14);
		if (m > 0) {
			if ((i1 & 1) != 0) {
				P -= 88;
				if (P < 0)
					P = 0;
				X = 1;
			}
			if ((i1 & 2) != 0) {
				P += 88;
				if (P > m)
					P = m;
				X = 1;
			}
		}
		if (aj == 0) {
			int k1 = e(j1);
			if (k1 >= 0) {
				k1 &= 0xffff;
				int j2 = (h[k1 + 17] & 0xff) / (ae[h[k1 + 13]] + 1);
				if ((i1 & 4) != 0 && am > 0) {
					am -= j2;
					X = 1;
				}
				if ((i1 & 8) != 0 && am < ak - j2) {
					am += j2;
					X = 1;
				}
			} else {
				int k3 = 0;
				int j4 = d(h[j1 + 2] & 0xff, 4);
				int l4 = b(j4);
				j4 += 8;
				byte byte0 = h[j4 - 3];
				byte byte1 = h[j4 - 2];
				for (int i5 = 0; i5 < l4;) {
					int j5 = h[j4 + 13] & 0xff;
					int k5 = h[j4 + 17] & 0xff;
					int i3 = h[j1 + 6 + i5] & 0xff;
					int k2 = i3 * (ae[j5] + 1);
					if (i5 == byte1) {
						k3 = i3 - k5 / (ae[j5] + 1);
						if (k3 < 0)
							k3 = 0;
					}
					i5++;
					j4 += 18;
				}

				if ((i1 & 4) != 0) {
					au -= byte0;
					X = 1;
				}
				if ((i1 & 8) != 0) {
					au += byte0;
					X = 1;
				}
				if (au < 0)
					au = 0;
				if (au > k3)
					au = k3;
			}
		} else {
			int j3 = D + (aa << 2);
			if ((h[j3 + 1] & 0xff) == 4 || (h[j3 + 1] & 0xff) == 9) {
				int k4 = d(h[j3 + 2] & 0xff);
				int l1 = h[j3 + 3] & 0xff;
				if ((i1 & 1) != 0) {
					G[aa]--;
					if (G[aa] < 0)
						G[aa] = k4 - 1;
					a(an, l1, 1, G[aa]);
					X = 1;
				}
				if ((i1 & 2) != 0) {
					G[aa]++;
					if (G[aa] >= k4)
						G[aa] = 0;
					a(an, l1, 4, G[aa]);
					X = 1;
				}
			}
			int l3;
			int i4;
			if (K) {
				l3 = aj - 1;
				i4 = 0;
			} else {
				l3 = 0;
				i4 = aj - 1;
			}
			if ((i1 & 0xc) != 0) {
				if ((i1 & 4) != 0) {
					aa--;
					if (aa < 0)
						aa = l3;
				} else {
					aa++;
					if (aa > aj - 1)
						aa = i4;
				}
				if (aa < i)
					i = aa;
				for (; c[aa + 1] - c[i] > (h[r + 17] & 0xff) + 1; i++)
					;
				X = 1;
			}
		}
	}

	public static void a(Graphics g1, int i1) {
		b _tmp = V;
		src.b.e();
		c(g1);
		c(i1);
		if (O)
			a(true);
	}

	private static void a(boolean flag) {
		int k2;
		int l2;
		int i3;
		if (H != s) {
			i3 = 1;
			k2 = af;
			l2 = H;
		} else {
			i3 = 0;
			k2 = H;
			l2 = af;
		}
		int i1 = s * 307;
		N[i1 + 0] = (byte) p;
		N[i1 + 1] = (byte) z;
		if (flag) {
			for (int j1 = 0; j1 < 14; j1++)
				aA[j1] = 0;

			for (int k1 = 0; k1 < 3; k1++)
				M[k1] = -1;

			for (int l1 = 0; l1 < 15; l1++)
				A[l1] = 0;

			ab = 0;
			b _tmp = V;
			src.b.bm = true;
			b _tmp1 = V;
			src.b.aV = t == 2;
			b _tmp2 = V;
			src.b.V = ((((x << 1) + 3) * 60 * 256) / 90) * 1000 >> 8;
			b _tmp3 = V;
			src.b.a(t, k2, l2, i3);
			a(1, k2, w[0]);
			a(1, l2, w[1]);
			for (int i2 = 0; i2 < 2; i2++)
				a(14, i2, Z[i2]);

			for (int j2 = 0; j2 < 10; j2++)
				a(12, j2, az[j2]);

			if (t == 3) {
				b _tmp4 = V;
				src.b.y = 2;
				b _tmp5 = V;
				src.b.bX = 8;
				b _tmp6 = V;
				src.b.c(4);
			} else {
				b _tmp7 = V;
				src.b.bX = 5;
				b _tmp8 = V;
				src.b.c(4);
			}
		}
		b _tmp9 = V;
		src.b.a(N, k2, y, 0, true);
		b _tmp10 = V;
		src.b.a(N, l2, y, 1, true);
		O = false;
	}

	private static void c(int i1, int j1) {
		if (j1 == 2) {
			if (i1 == 21) {
				int l1 = aA[12] + aA[13];
				if (l1 > 0) {
					aA[10] = (aA[12] * 100) / l1;
					aA[11] = 100 - aA[10];
				}
			}
			if (i1 == 2) {
				G[0] = n;
				G[1] = T;
				G[2] = x;
			}
			if (i1 == 10) {
				t = 1;
				if (G[0] == G[1]) {
					G[0] = 0;
					G[1] = 1;
				}
			}
			if (i1 == 3) {
				s = H = 0;
				af = 0;
				t = 2;
			}
			if (i1 == 19)
				G[0] = p;
			if (i1 == 20)
				G[0] = z;
			if (i1 == 11) {
				if (v < 0)
					v = 0;
				G[0] = v;
			}
			if (i1 == 17 || i1 == 18) {
				for (int i2 = 0; i2 < 15; i2++)
					b[i2] = 10;

				b _tmp = V;
				src.b.a(p, b);
				L = -1;
				m = g[0].stringWidth(aw) - 176;
				if (m < 0)
					m = 0;
				if (i1 == 18)
					a(g[0], aw);
				else
					a(g[0], J);
			}
			if (i1 == 16) {
				a(g[0], o);
				m = aC[0] * 6 - 156;
				if (m < 0)
					m = 0;
			}
			if ((i1 == 12 || i1 == 13) && G[0] == G[1]) {
				G[0] = 0;
				G[1] = 1;
			}
			if (i1 == 29 || i1 == 28) {
				if (i1 == 29) {
					int k1 = d(an, 2);
					h[k1 + 6 + 0] = (byte) (I * 3 - 1);
				}
				a(g[2], u);
			}
		}
		if (j1 == 3) {
			if (i1 == 2) {
				n = G[0];
				T = G[1];
				x = G[2];
				h();
			}
			if (i1 == 10) {
				s = H = G[0];
				af = G[1];
				for (int j2 = 0; j2 < 16; j2++)
					U[j2] = (byte) j2;

				y = U;
			}
			if (i1 == 19)
				p = G[0];
			if (i1 == 20)
				z = G[0];
			if (i1 == 11) {
				int k2 = G[0];
				ai = d(0);
				int i3 = k2 * 307;
				p = N[i3 + 0];
				z = 0;
				v = k2;
				g();
				for (int l2 = 0; l2 < 16; l2++)
					e[l2] = (byte) l2;

				d = 0;
				ao = 0;
				h();
			}
			if (i1 == 12 || i1 == 13) {
				s = H = G[0];
				af = G[1];
			}
			if (Y == 7) {
				H = s = v;
				y = e;
				a(d);
				if (d == S && ao < 4) {
					for (; ao < 4; ao++) {
						S++;
						f(d, S);
						d = S;
					}

					h();
				}
				if (d == S)
					Y = 9;
			}
		}
	}

	private static void a(int i1, int j1, int k1, int l1) {
		if (k1 == 0) {
			if (j1 >= 44 && j1 <= 58 && (i1 != 18 || ab < 3)) {
				int k2 = j1 - 44;
				if (A[y[k2]] < 2)
					if (L == k2)
						L = -1;
					else if (L == -1)
						L = k2;
					else if (k2 < 11 || L < 11) {
						int i3 = -1;
						if (k2 > 10)
							i3 = k2;
						if (L > 10)
							i3 = L;
						if (i1 != 18 || M[0] != i3 && M[1] != i3 && M[2] != i3) {
							if (i1 == 18 && i3 >= 0) {
								M[ab] = (byte) i3;
								ab++;
							}
							i3 = y[k2];
							y[k2] = y[L];
							y[L] = (byte) i3;
							L = -1;
						}
					}
			}
			if (j1 == 1 && v >= 0)
				Y = 6;
			if (j1 == 41 && k1 == 0 && d == S) {
				v = -1;
				h();
				Y = 1;
			}
			if (j1 >= 107 && j1 <= 116) {
				Q = 30;
				int i2 = d(31, 2);
				h[i2 + 18 + 0] = (byte) (32 + (j1 - 107));
			}
			if (j1 >= 5 && j1 <= 8) {
				b _tmp = V;
				src.b.aR = j1 - 5;
				Q = 32;
				int j2 = d(32, 2);
				h[j2 + 18 + 0] = (byte) (42 + (j1 - 5));
			}
			if (j1 == 10) {
				Y = Q;
				F = true;
			}
			if (i1 == 14)
				if (j1 == 22) {
					b _tmp1 = V;
					src.b.C = 1;
				} else if (j1 == 23) {
					b _tmp2 = V;
					src.b.C = 2;
				}
			if (j1 == 21 || j1 == 17 || j1 == 117) {
				if (j1 == 117)
					t = 2;
				else if (j1 == 21)
					t = 3;
				else
					t = 1;
				O = true;
			} else if (j1 == 9) {
				h();
				b _tmp3 = V;
				src.b.c(9);
			} else if (j1 == 71) {
				a(false);
				b _tmp4 = V;
				src.b.y = 3;
				b _tmp5 = V;
				src.b.c(4);
			} else if (j1 == 43) {
				F = true;
				Y = Q;
			} else if (j1 == 72) {
				for (int l2 = 0; l2 < 15; l2++)
					A[l2] = 0;

				b _tmp6 = V;
				src.b.y = 7;
				b _tmp7 = V;
				src.b.b(true);
				Y = 0;
			} else if (j1 == 11) {
				if (d == S) {
					Y = 15;
				} else {
					t = 0;
					O = true;
				}
			} else if (j1 != 24)
				;
		}
		if ((k1 == 1 || k1 == 4) && (j1 == 59 || j1 == 61))
			if (j1 == 59)
				p = G[0];
			else
				z = G[0];
		if (k1 == 1) {
			if (j1 == 2 && G[0] != 0) {
				n = 1;
				b _tmp8 = V;
				src.b.f(2);
			}
			if (j1 == 19)
				do {
					if (G[1] != G[0])
						break;
					G[1]--;
					if (G[1] < 0)
						G[1] = d(0) - 1;
				} while (true);
			else if (j1 == 18)
				do {
					if (G[0] != G[1])
						break;
					G[0]--;
					if (G[0] < 0)
						G[0] = d(0) - 1;
				} while (true);
		}
		if (k1 == 4) {
			if (j1 == 2 && G[0] != 0) {
				n = 1;
				b _tmp9 = V;
				src.b.f(2);
			}
			if (j1 == 19)
				do {
					if (G[1] != G[0])
						break;
					G[1]++;
					if (G[1] >= d(0))
						G[1] = 0;
				} while (true);
			else if (j1 == 18)
				do {
					if (G[0] != G[1])
						break;
					G[0]++;
					if (G[0] >= d(0))
						G[0] = 0;
				} while (true);
		}
	}

	private static int a() {
		if (ao == 4) {
			byte byte0 = 52;
			for (int i1 = 0; i1 < 4; i1++)
				if (v == at[byte0 + i1])
					return i1;

		}
		return -1;
	}

	private static int a(Graphics g1, int i1, int j1, int k1, int l1, int i2,
			boolean flag) {
		int k6 = 0;
		switch (j1) {
		case 12: // '\f'
			a(g1, a(2, ax), l1, i2, 17);
			k6 = 1;
			break;

		case 13: // '\r'
			a(g1, a(0, H & 0xff), l1, i2, 17);
			k6 = 1;
			break;

		case 14: // '\016'
			a(g1, a(0, af & 0xff), l1, i2, 17);
			k6 = 1;
			break;

		case 15: // '\017'
			byte byte0;
			if (a() >= 0)
				byte0 = 29;
			else
				byte0 = 28;
			a(g1, d(byte0, 0), l1, i2, 17);
			k6 = 1;
			break;

		case 16: // '\020'
			int j2 = a();
			if (j2 >= 0)
				a(g1, a(4, j2), l1, i2, 17);
			k6 = 1;
			break;

		case 64: // '@'
			g1.setColor(0xffeeaa);
			g1.fillRect(1, i2, 174, ae[2]);
			g1.setGrayScale(255);
			break;

		case 60: // '<'
		case 62: // '>'
			b _tmp = V;
			src.b.h(p);
			b _tmp1 = V;
			src.b.a(p, C);
			int i9 = W[1].getWidth();
			g1.drawImage(W[1], l1, i2, 17);
			l1 -= i9 / 2;
			for (int k2 = 0; k2 < 11; k2++) {
				b _tmp2 = V;
				int l9 = 160 - (src.b.aN[2][9 + k2 * 2 + 1] >> 16);
				b _tmp3 = V;
				int j10 = src.b.aN[2][9 + k2 * 2 + 0] >> 16;
				if (k2 != 0 && j1 == 62)
					if (G[0] < 3)
						l9 += (G[0] - 1) * 12;
					else if (G[0] == 3) {
						if (C[k2] >= 9)
							l9 += 12;
					} else if (G[0] == 4)
						j10 = ((j10 - 48) * 19 >> 4) + 48;
					else if (G[0] == 5)
						j10 = ((j10 - 48) * 3 >> 2) + 48;
				l9 = l9 * 270 >> 8;
				j10 = j10 * 195 >> 8;
				g1.setColor(0);
				g1.fillRect(((l1 + l9) - 1) + 1, i2 + j10 + 1, 6, 6);
				g1.setColor(a[C[k2]]);
				g1.fillRect((l1 + l9) - 1, i2 + j10, 6, 6);
			}

			k6 = 1;
			break;

		case 42: // '*'
			int i10 = l1;
			for (int l2 = 0; l2 < 9; l2++) {
				byte byte1;
				if (l2 > 1)
					byte1 = 24;
				else
					byte1 = 20;
				a(g1, a(11, l2), i10 + 1, i2, byte1);
				i10 = l1 + aC[l2];
			}

			k6 = 1;
			break;

		case 63: // '?'
			int i3 = g[2].stringWidth(ap) >> 1;
			int j4;
			if (s == H)
				j4 = af;
			else
				j4 = H;
			a(g1, a(1, s), l1 - i3, i2, 24);
			a(g1, a(1, j4), l1 + i3, i2, 20);
			break;
		}
		if (j1 >= 44 && j1 <= 58) {
			int k5 = j1 - 44;
			g1.setColor(a[b[k5]]);
			g1.fillRect(l1, i2 - 1, aC[0] - 2, ae[0] + 3);
			g1.fillRect((l1 + aC[0]) - 1, i2 - 1, 880, ae[0] + 3);
			i2++;
			if (flag)
				g1.setColor(0xffdd11);
			else
				g1.setColor(0xffffff);
			if (j1 - 44 == L)
				g1.setGrayScale(0);
			int l6 = a(10, b[k5]);
			a(g1, l6, l1 + 1, i2, 20);
			l6 = s * 307 + y[k5] * 20 + 7;
			int k4 = a(g[0], N, l6, 16);
			a(g1, N, l6, 16, l1 + aC[0], i2, 20);
			int j3 = a(10, N[l6 + 19]);
			a(g1, j3, l1 + aC[1] + 1, i2, 24);
			for (j3 = 0; j3 < 3 && l1 + aC[j3 * 2 + 2] <= 208; j3++) {
				int l8 = N[l6 + 16 + j3] >> 4 & 0xf;
				int k7 = a(l8, 0, 2, false, false);
				a(g1, as, 0, k7, l1 + aC[j3 * 2 + 2], i2, 24);
				l8 = N[l6 + 16 + j3] & 0xf;
				k7 = a(l8, 0, 2, false, false);
				a(g1, as, 0, k7, l1 + aC[j3 * 2 + 3], i2, 24);
			}

			j3 = A[y[k5]];
			if (j3 != 0) {
				if (j3 == 1)
					g1.setColor(0xffff00);
				else
					g1.setColor(0xff0000);
				g1.fillRect(l1 + aC[0] + k4 + 1, i2, (ae[0] - 2) * 3 >> 2,
						ae[0] - 1);
			}
			return 1;
		}
		if (j1 == 40) {
			int j9 = aC[0] - 12;
			int k9 = ae[0] + 2;
			l1++;
			for (int l4 = 0; l4 < 4; l4++) {
				int l5 = ag[l4 * 4 + 3];
				i2 = -au * (ae[0] + 2) + (ag[l4 * 4 + 1] * k9 >> 1) + 1;
				for (int k3 = 0; k3 < ag[l4 * 4 + 0]; k3++) {
					g1.setGrayScale(64);
					l1 += 2;

⌨️ 快捷键说明

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