c.java

很好的3款手机游戏源码

// Decompiled by Jad v1.5.8e2. Copyright 2001 Pavel Kouznetsov.
// Jad home page: http://kpdus.tripod.com/jad.html
// Decompiler options: packimports(3) fieldsfirst ansi space 

import javax.microedition.lcdui.Graphics;

public class c
{

	public static int a_int_static;
	public static int b_int_static;
	public static int c;
	public static int d;
	public static int e;
	public static int f;
	public static int g;
	public static int h;
	public static int i;
	public static int j;
	public static int k;
	public static int l;
	public static int m;
	public static int n;
	public static int o;
	public static int p;
	public static int q;
	public static int r;
	public static int s;
	public static int t;
	public static int u;
	public static int a_int_array1d_static[];
	public static u a_u_static;
	public static int v;
	public static int w;
	public static int x;
	public static int y;
	public static int z;
	public static b a_b_static;
	public static int A;
	public static int B;
	public static int C;
	public static boolean a_boolean_static;
	public static int D;
	public static int E;
	public static boolean b_boolean_static;
	public static byte a_byte_static;
	public static byte b_byte_static = 100;
	public static byte a_byte_array2d_static[][] = new byte[5][7];
	public static final int a_int_array2d_static[][] = {
		{
			60, 20, 20, -50, -50, 28
		}, {
			30, 50, -70, -30, 20, 24
		}, {
			-70, 20, -30, 60, 20, 24
		}, {
			30, -50, 60, -50, 10, 32
		}, {
			10, 80, -40, 10, -60, 16
		}, {
			33, -60, 33, -40, 34, 20
		}, {
			-50, -50, 33, 34, 33, 24
		}, {
			-60, 20, -40, 70, 10, 16
		}
	};

	public c()
	{
	}

	public static void a()
	{
		e = 0;
		f = 0;
		g = 0;
		h = 0;
		i = 0;
		a_byte_array2d_static = new byte[5][7];
		c();
	}

	public static void b()
	{
		e = 2;
		f = 2;
		g = 3;
		h = 2;
		i = 3;
		a_byte_array2d_static = new byte[5][7];
		c();
		c = a_int_static;
		d = b_int_static;
	}

	public static void c()
	{
		a_int_static = (g * n.c_p_static.a("life_P")) / n.c_p_static.a("life_D");
		b_int_static = (i * n.c_p_static.a("magic_P")) / n.c_p_static.a("magic_D");
		j = (e * n.c_p_static.a("pAtk_P")) / n.c_p_static.a("pAtk_D");
		l = (g * n.c_p_static.a("pDef_P")) / n.c_p_static.a("pDef_D");
		k = (h * n.c_p_static.a("mAtk_P")) / n.c_p_static.a("mAtk_D");
		m = (g * n.c_p_static.a("mDef_P")) / n.c_p_static.a("mDef_D");
		n = (f * n.c_p_static.a("speed_P")) / n.c_p_static.a("speed_D") + 20;
		o = (f * n.c_p_static.a("critical_P")) / n.c_p_static.a("critical_D");
		int i1 = ((e + f + g + h + i) - 25) / 5;
		p = ((f * n.c_p_static.a("hit_Rate_P")) / n.c_p_static.a("hit_Rate_D") + 90) - i1 * 4;
		x = 40 - (n * 20) / 100;
		if (c > a_int_static)
			c = a_int_static;
		if (d > b_int_static)
			d = b_int_static;
	}

	public static boolean a(int i1)
	{
		boolean flag = false;
		for (int j1 = 0; j1 < a_byte_array2d_static.length; j1++)
		{
			if (a_byte_array2d_static[j1][0] != 0 || flag)
				continue;
			a_byte_array2d_static[j1][0] = (byte)(i1 + 1);
			int k1 = n.a(0, 99);
			int ai[][] = new int[3][2];
			int l1 = 0;
			for (int i2 = 0; i2 < a_int_array2d_static[i1].length - 1; i2++)
				if (a_int_array2d_static[i1][i2] > 0)
				{
					ai[l1][0] = i2 + 1;
					ai[l1][1] = a_int_array2d_static[i1][i2];
					l1++;
				}

			if (k1 < ai[0][1])
				a_byte_array2d_static[j1][ai[0][0]] = (byte)n.a(2, 3);
			else
			if (k1 < ai[0][1] + ai[1][1])
				a_byte_array2d_static[j1][ai[1][0]] = (byte)n.a(2, 3);
			else
				a_byte_array2d_static[j1][ai[2][0]] = (byte)n.a(2, 3);
			int j2 = n.a(0, 99);
			ai = new int[2][2];
			l1 = 0;
			for (int k2 = 0; k2 < a_int_array2d_static[i1].length - 1; k2++)
				if (a_int_array2d_static[i1][k2] < 0)
				{
					ai[l1][0] = k2 + 1;
					ai[l1][1] = -a_int_array2d_static[i1][k2];
					l1++;
				}

			if (j2 < ai[0][1])
				a_byte_array2d_static[j1][ai[0][0]] = (byte)(-n.a(1, 2));
			else
				a_byte_array2d_static[j1][ai[1][0]] = (byte)(-n.a(1, 2));
			a_byte_array2d_static[j1][6] = (byte)n.a((a_int_array2d_static[i1][5] * 2) / 3, (a_int_array2d_static[i1][5] * 4) / 3);
			flag = true;
		}

		return flag;
	}

	public static void d()
	{
		q = 1;
		b_boolean_static = false;
		w = 0;
		x = 40 - (n * 20) / 100;
		y = 0;
		z = 0;
		s = 0;
		a_b_static = new b(0);
		a_b_static.a();
		w = (r.g * y) / x;
		int ai[] = {
			r.a_int_array1d_static[0] + r.c[0], r.a_int_array1d_static[1] + r.c[1]
		};
		a_int_array1d_static = ai;
		if (a_u_static == null)
			a_u_static = new u("/pet_Battle.ani");
		a_u_static.a(0, a_int_array1d_static[0], a_int_array1d_static[1]);
		a_u_static.j = -39;
		t = c;
		u = d;
		if (c <= 0)
			c = 1;
	}

	public static void e()
	{
		a_u_static = null;
	}

	public static void a(Graphics g1)
	{
		if (q != 7)
			a_u_static.a(g1, null);
	}

	public static void f()
	{
		a_u_static.a();
		a_b_static.b();
		if (a_u_static.a == -1)
			a_u_static.a(0, a_int_array1d_static[0], a_int_array1d_static[1]);
		if (q != 7 && !r.b)
			i();
		boolean flag = false;
		if (z < y)
		{
			int i1 = (y - z) / 4;
			if (i1 < 1)
				i1 = 1;
			z += i1;
		}
		if (z > y)
		{
			int j1 = (z - y) / 4;
			if (j1 < 1)
				j1 = 1;
			z -= j1;
		}
		w = (r.g * z) / x;
		if (t < c)
		{
			int k1 = (c - t) / 4;
			if (k1 < 1)
				k1 = 1;
			t += k1;
		}
		if (t > c && t > 0)
		{
			int l1 = (t - c) / 4;
			if (l1 < 1)
				l1 = 1;
			t -= l1;
		}
		if (u < d)
		{
			int i2 = (d - u) / 4;
			if (i2 < 1)
				i2 = 1;
			u += i2;
		}
		if (u > d && u > 0)
		{
			int j2 = (u - d) / 4;
			if (j2 < 1)
				j2 = 1;
			u -= j2;
		}
		l();
		switch (q)
		{
		case 1: // '\001'
			p();
			break;

		case 3: // '\003'
			j();
			break;

		case 5: // '\005'
			s();
			break;

		case 16: // '\020'
			o();
			break;

		case 2: // '\002'
			n();
			break;

		case 17: // '\021'
			m();
			break;

		case 4: // '\004'
			k();
			break;

		case 6: // '\006'
			h();
			break;
		}
	}

	private static void h()
	{
		a_u_static.j += 4;
		if (a_u_static.j > 0)
		{
			q = 7;
			b_boolean_static = false;
			r.c();
		}
	}

	private static void i()
	{
		if (c <= 0)
		{
			q = 6;
			b_boolean_static = true;
		}
	}

	private static void j()
	{
		if (a_u_static.a != 3)
			a_u_static.a(3, a_int_array1d_static[0], a_int_array1d_static[1]);
		if (!r.b)
		{
			y++;
			if (y > x)
			{
				b_boolean_static = true;
				q = 4;
				switch (s)
				{
				default:
					break;

				case -2: 
					if (j.k <= 0)
						s = -1;
					break;

				case -1: 
					if (c <= 0)
						s = -2;
					break;

				case 0: // '\0'
				case 1: // '\001'
				case 2: // '\002'
					if (r.a_s_array1d_static[s].h > 0)
						break;
					boolean flag = false;
					for (int j1 = 0; j1 < r.a_int_static; j1++)
						if (r.a_s_array1d_static[j1].h > 0 && !flag)
						{
							s = j1;
							flag = true;
						}

					break;
				}
				int i1 = 0;
				int k1 = 0;
				switch (a_b_static.a_int)
				{
				case 0: // '\0'
					switch (s)
					{
					case -2: 
						i1 = j.a[0];
						k1 = j.a[1];
						break;

					case -1: 
						i1 = a_int_array1d_static[0];
						k1 = a_int_array1d_static[1];
						break;
					}
					// fall through

				default:
					a_b_static.a(i1, k1);
					d -= a_b_static.b;
					break;
				}
			}
		}
	}

	private static void k()
	{
		if (a_u_static.a != 3)
			a_u_static.a(3, a_int_array1d_static[0], a_int_array1d_static[1]);
		if (a_b_static.a_u.a == -1)
		{
			switch (s)
			{
			default:
				break;

			case -2: 
				D = (k * a_b_static.d) / 10;
				if (D < 1)
					D = 1;
				j.k += D;
				if (j.k > j.g + j.h)
					j.k = j.g + j.h;
				break;

			case -1: 
				D = (k * a_b_static.d) / 10;
				if (D < 1)
					D = 1;
				c += D;
				if (c > a_int_static)
					c = a_int_static;
				break;
			}
			q = 1;
			a_u_static.a(0, a_int_array1d_static[0], a_int_array1d_static[1]);
			y = 0;
			z = 0;
			w = 0;
			b_boolean_static = false;
		}
	}

	private static void l()
	{
		if (B > 0 || B == -2)
		{
			C++;
			if (C >= 7)
			{
				C = 0;
				B = 0;
			}
		}
		if (D > 0)
		{
			E++;
			if (E >= 7)
			{
				E = 0;
				D = 0;
			}
		}
	}

	private static void m()
	{
		if (a_int_array1d_static[0] < r.a_int_array1d_static[0] + r.c[0])
			a_int_array1d_static[0] += (r.c[0] - r.a_int_array2d_static[r.a_s_array1d_static[s].b][0] - 32) / 4;
		if (a_int_array1d_static[1] > r.a_int_array1d_static[1] + r.c[1])
			a_int_array1d_static[1] -= (r.a_int_array2d_static[r.a_s_array1d_static[s].b][1] - r.c[1]) / 4;
		if (a_int_array1d_static[1] < r.a_int_array1d_static[1] + r.c[1])
			a_int_array1d_static[1] += (r.c[1] - r.a_int_array2d_static[r.a_s_array1d_static[s].b][1]) / 4;
		a_u_static.a(a_int_array1d_static[0], a_int_array1d_static[1]);
		if (a_int_array1d_static[0] >= r.a_int_array1d_static[0] + r.c[0])
		{
			a_int_array1d_static[0] = r.a_int_array1d_static[0] + r.c[0];
			a_int_array1d_static[1] = r.a_int_array1d_static[1] + r.c[1];
			q = 1;
			y = 0;
			z = 0;
			w = 0;
			b_boolean_static = false;
			a_u_static.a(0, a_int_array1d_static[0], a_int_array1d_static[1]);
		}
	}

	private static void n()
	{
		if (B != -1 && B != -2 && a_u_static.a != 1)
		{
			q = 17;
			r.a_s_array1d_static[s].c();
		} else
		if ((B == -1 || B == -2) && a_u_static.a != 2)
		{
			q = 17;
		} else
		{
			byte byte0 = 2;
			int i1 = 4;
			if (a_u_static.e == byte0)
				if (B != -1)
				{
					if (n.c_boolean_static)
						r.a_k_static.c();
					r.a_s_array1d_static[s].w = r.a_s_array1d_static[s].v;
					r.a_s_array1d_static[s].v = 5;
					r.a_s_array1d_static[s].d();
					r.a_s_array1d_static[s].E = i1;
					a_boolean_static = false;
					if (n.a(0, 99) < o)
					{
						a_boolean_static = true;
						B = (j - r.a_s_array1d_static[s].q) * 2;
					} else
					{
						B = j - r.a_s_array1d_static[s].q;
					}
					if (B < 1)
						B = 1;
					r.a_s_array1d_static[s].h -= B;
					if (r.a_s_array1d_static[s].h < 0)
						r.a_s_array1d_static[s].h = 0;
				} else
				{
					B = -2;
				}
		}
	}

	private static void o()
	{
		if (a_int_array1d_static[0] > r.a_s_array1d_static[s].a[0] + 32)
			a_int_array1d_static[0] -= (r.c[0] - r.a_int_array2d_static[r.a_s_array1d_static[s].b][0] - 32) / 4;
		if (a_int_array1d_static[1] < r.a_s_array1d_static[s].a[1])
			a_int_array1d_static[1] += (r.a_int_array2d_static[r.a_s_array1d_static[s].b][1] - r.c[1]) / 4;
		if (a_int_array1d_static[1] > r.a_s_array1d_static[s].a[1])
			a_int_array1d_static[1] -= (r.c[1] - r.a_int_array2d_static[r.a_s_array1d_static[s].b][1]) / 4;
		a_u_static.a(a_int_array1d_static[0], a_int_array1d_static[1]);
		if (a_int_array1d_static[0] <= r.a_s_array1d_static[s].a[0] + 32)
		{
			a_int_array1d_static[0] = r.a_s_array1d_static[s].a[0] + 32;
			a_int_array1d_static[1] = r.a_s_array1d_static[s].a[1];
			q = 2;
			if (n.a(0, 99) < p)
			{
				a_u_static.a(1, a_int_array1d_static[0], a_int_array1d_static[1]);
			} else
			{
				B = -1;
				a_u_static.a(2, a_int_array1d_static[0], a_int_array1d_static[1]);
			}
		}
	}

	private static void p()
	{
		if (!r.b)
		{
			y++;
			boolean flag = true;
			for (int i1 = 0; i1 < r.a_s_array1d_static.length; i1++)
				if (r.a_s_array1d_static[i1].v != 7)
					flag = false;

			if (y > x && c > 0 && !flag)
			{
				q();
				r();
				if (q == 3)
				{
					y -= n.c_p_static.a("skill_" + a_b_static.a_int + ".t_Cost");
					a_u_static.a(3, a_int_array1d_static[0], a_int_array1d_static[1]);
				} else
				{
					b_boolean_static = true;
				}
			}
		}
	}

	private static void q()
	{
		byte byte0;
		switch (v)
		{
		case 3: // '\003'
			byte0 = 75;
			break;

		default:
			byte0 = 40;
			break;
		}
		if (d >= a_b_static.b)
		{
			if ((j.k * 100) / (j.g + j.h) < byte0)
				q = 3;
			else
			if ((c * 100) / a_int_static <= 40)
				q = 3;
			else
				q = 16;
		} else
		{
			q = 16;
		}
	}

	private static void r()
	{
label0:
		switch (q)
		{
		default:
			break;

		case 3: // '\003'
			byte byte0;
			switch (v)
			{
			case 3: // '\003'
				byte0 = 75;
				break;

			default:
				byte0 = 40;
				break;
			}
			if ((j.k * 100) / (j.g + j.h) < byte0)
				s = -2;
			else
			if ((c * 100) / a_int_static < 40)
				s = -1;
			break;

		case 16: // '\020'
			switch (v)
			{
			default:
				break label0;

			case 1: // '\001'
			case 3: // '\003'
				int i1;
				for (i1 = 0; r.a_s_array1d_static[i1].h <= 0; i1++);
				for (int j1 = 0; j1 < r.a_int_static; j1++)
					if (r.a_s_array1d_static[j1].h < r.a_s_array1d_static[i1].h && r.a_s_array1d_static[j1].h > 0)
						i1 = j1;

				s = i1;
				break label0;

			case 2: // '\002'
				int k1;
				for (k1 = 0; r.a_s_array1d_static[k1].h <= 0; k1++);
				for (int l1 = 0; l1 < r.a_int_static; l1++)
					if (r.a_s_array1d_static[l1].h > r.a_s_array1d_static[k1].h && r.a_s_array1d_static[l1].h > 0)
						k1 = l1;

				s = k1;
				break label0;

			case 0: // '\0'
				break;
			}
			if (j.R >= 0 && j.R <= 2 && r.a_s_array1d_static[j.R].h > 0)
			{
				s = j.R;
				break;
			}
			int i2;
			for (i2 = 0; r.a_s_array1d_static[i2].h <= 0; i2++);
			for (int j2 = 0; j2 < r.a_int_static; j2++)
				if (r.a_s_array1d_static[j2].h < r.a_s_array1d_static[i2].h && r.a_s_array1d_static[j2].h > 0)
					i2 = j2;

			s = i2;
			break;
		}
	}

	public static void g()
	{
		b_boolean_static = true;
		a_u_static.a(4, a_int_array1d_static[0], a_int_array1d_static[1]);
	}

	private static void s()
	{
		b_boolean_static = true;
		if (a_u_static.a != 4)
			a_u_static.a(4, a_int_array1d_static[0], a_int_array1d_static[1]);
		A--;
		if (A <= 0)
		{
			q = r;
			b_boolean_static = false;
		}
	}

}