📄 s.java
字号:
// 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 s
{
public int a_int;
public String a_java_lang_String;
public int b_int;
private int H;
public int c_int;
public static final String a_java_lang_String_array1d_static[] = {
"Soldier_A", "Soldier_B", "Bull", "Tiger", "Tree", "Bat", "Rat", "Soul", "Witch", "Tiger_W",
"Boss_Guardian", "Boss_Snake", "Boss_YunXiao"
};
public int d_int;
public int e_int;
public int f;
public int g;
public int h;
public int i;
public int j;
public int k;
public int l;
public int m;
public int n;
public int o;
public int p;
public int q;
public int r;
public int s;
public int t;
public int u;
public int v;
public int w;
public int x;
public int y;
public int z;
public int a_int_array1d[];
public int b_int_array1d[];
public u a_u;
public int A;
public int B;
public int C;
public int D;
public b a_b;
public static final int c_int_array1d_static[] = {
5, 6, 6, 2, 5, 7, 6, 3, 4, 2,
7, 2, 1
};
public int E;
public int F;
public int G;
public boolean a_boolean;
public int d_int_array1d[];
public int e_int_array1d[];
public boolean b_boolean;
public s()
{
}
public void a(int i1)
{
c_int = i1;
v = 1;
A = 0;
C = 0;
D = 0;
x = 0;
b_boolean = false;
switch (n.a.h)
{
case 15: // '\017'
case 21: // '\025'
H = -72;
break;
default:
H = -r.e[0];
break;
}
switch (n.a.h)
{
case 15: // '\017'
a_int = 11;
break;
case 5: // '\005'
a_int = 10;
break;
case 21: // '\025'
a_int = 12;
break;
default:
a_int = z.e[n.a.h][n.a(0, 2)];
break;
}
a_java_lang_String = n.c_p_static.a(a_java_lang_String_array1d_static[a_int] + ".name");
switch (n.a.h)
{
case 5: // '\005'
d_int = 3;
break;
case 15: // '\017'
d_int = 10;
break;
case 21: // '\025'
d_int = 15;
break;
default:
d_int = n.a(z.e[n.a.h][3], z.e[n.a.h][4]);
break;
}
e_int = d_int;
e();
f();
a_b = new b(c_int_array1d_static[a_int]);
a_b.a();
a_u = new u("/enemy_" + a_java_lang_String_array1d_static[a_int] + "_Battle.ani");
a_u.a(0, a_int_array1d[0], a_int_array1d[1]);
y = h;
z = i;
switch (n.a.h)
{
case 15: // '\017'
a_u.j = -81;
break;
case 21: // '\025'
a_u.j = -81;
break;
default:
a_u.j = -47;
break;
}
d_int_array1d = new int[r.a_int_static + 2];
e_int_array1d = new int[r.a_int_static + 2];
}
private void e()
{
String s1 = a_java_lang_String_array1d_static[a_int];
j = (d_int * n.c_p_static.a(s1 + ".str_P")) / n.c_p_static.a(s1 + ".str_D");
k = (d_int * n.c_p_static.a(s1 + ".agi_P")) / n.c_p_static.a(s1 + ".agi_D");
l = (d_int * n.c_p_static.a(s1 + ".sta_P")) / n.c_p_static.a(s1 + ".sta_D");
m = (d_int * n.c_p_static.a(s1 + ".int_P")) / n.c_p_static.a(s1 + ".int_D");
n = (d_int * n.c_p_static.a(s1 + ".spi_P")) / n.c_p_static.a(s1 + ".spi_D");
}
private void f()
{
f = (l * n.c_p_static.a("life_P")) / n.c_p_static.a("life_D");
g = (n * n.c_p_static.a("magic_P")) / n.c_p_static.a("magic_D");
o = (j * n.c_p_static.a("pAtk_P")) / n.c_p_static.a("pAtk_D");
q = (l * n.c_p_static.a("pDef_P")) / n.c_p_static.a("pDef_D");
p = (m * n.c_p_static.a("mAtk_P")) / n.c_p_static.a("mAtk_D");
r = (l * n.c_p_static.a("mDef_P")) / n.c_p_static.a("mDef_D");
s = (k * n.c_p_static.a("speed_P")) / n.c_p_static.a("speed_D") + 20;
t = (k * n.c_p_static.a("critical_P")) / n.c_p_static.a("critical_D");
u = ((k * n.c_p_static.a("hit_Rate_P")) / n.c_p_static.a("hit_Rate_D") + 90) - d_int * 4;
f += n.a(-f / 5, f / 5);
g += n.a(-g / 5, g / 5);
o += n.a(-o / 5, o / 5);
q += n.a(-q / 5, q / 5);
p += n.a(-p / 5, p / 5);
r += n.a(-r / 5, r / 5);
s += n.a(-s / 2, s / 2);
t += n.a(-t / 5, t / 5);
u += n.a(-u / 5, u / 5);
h = f;
i = g;
B = 40 - (s * 20) / 100;
}
public void a()
{
a_u = null;
}
public void a(Graphics g1)
{
if (v != 7)
a_u.a(g1, r.a_javax_microedition_lcdui_Image_static);
}
public void b()
{
a_u.a();
a_b.b();
if (a_u.a == -1)
a_u.a(0, a_int_array1d[0], a_int_array1d[1]);
if (v != 7 && !r.b_boolean_static)
c();
boolean flag = false;
if (D < C)
{
int i1 = (C - D) / 4;
if (i1 < 1)
i1 = 1;
D += i1;
}
if (D > C)
{
int j1 = (D - C) / 4;
if (j1 < 1)
j1 = 1;
D -= j1;
}
A = (r.g * D) / B;
if (y < h)
{
int k1 = (h - y) / 4;
if (k1 < 1)
k1 = 1;
y += k1;
}
if (y > h && y > 0)
{
int l1 = (y - h) / 4;
if (l1 < 1)
l1 = 1;
y -= l1;
}
if (z < i)
{
int i2 = (i - z) / 4;
if (i2 < 1)
i2 = 1;
z += i2;
}
if (z > i && z > 0)
{
int j2 = (z - i) / 4;
if (j2 < 1)
j2 = 1;
z -= j2;
}
i();
switch (v)
{
case 1: // '\001'
m();
break;
case 5: // '\005'
j();
break;
case 16: // '\020'
o();
break;
case 2: // '\002'
k();
break;
case 17: // '\021'
l();
break;
case 3: // '\003'
n();
break;
case 6: // '\006'
h();
break;
case 4: // '\004'
g();
break;
}
}
public void c()
{
if (h <= 0)
if (v == 19)
{
v = 7;
e_int = 0;
} else
{
v = 6;
b_boolean = true;
}
}
private void g()
{
if (a_u.a != 3)
a_u.a(3, a_int_array1d[0], a_int_array1d[1]);
if (a_b.a_u.a == -1)
{
int i1 = 4;
switch (x)
{
case -3:
default:
break;
case -2:
j.U -= a_b.e;
if (j.U < 0)
j.U = 0;
j.O = j.N;
j.N = 5;
j.o();
j.Y = i1;
d_int_array1d[d_int_array1d.length - 2] = (p * a_b.d - (j.D + j.E)) / 10;
if (d_int_array1d[d_int_array1d.length - 2] < 1)
d_int_array1d[d_int_array1d.length - 2] = 1;
j.k -= d_int_array1d[d_int_array1d.length - 2];
if (j.k < 0)
j.k = 0;
break;
case -1:
c.y -= a_b.e;
if (c.y < 0)
c.y = 0;
c.r = c.q;
c.q = 5;
c.g();
c.A = i1;
d_int_array1d[d_int_array1d.length - 1] = (p * a_b.d - c.m) / 10;
if (d_int_array1d[d_int_array1d.length - 1] < 1)
d_int_array1d[d_int_array1d.length - 1] = 1;
c.c -= d_int_array1d[d_int_array1d.length - 1];
if (c.c < 0)
c.c = 0;
break;
case -4:
j.O = j.N;
j.N = 5;
j.o();
j.Y = i1;
d_int_array1d[d_int_array1d.length - 2] = (p * a_b.d - (j.D + j.E)) / 10;
if (d_int_array1d[d_int_array1d.length - 2] < 1)
d_int_array1d[d_int_array1d.length - 2] = 1;
j.k -= d_int_array1d[d_int_array1d.length - 2];
if (j.k < 0)
j.k = 0;
c.r = c.q;
c.q = 5;
c.g();
c.A = i1;
d_int_array1d[d_int_array1d.length - 1] = (p * a_b.d - c.m) / 10;
if (d_int_array1d[d_int_array1d.length - 1] < 1)
d_int_array1d[d_int_array1d.length - 1] = 1;
c.c -= d_int_array1d[d_int_array1d.length - 1];
if (c.c < 0)
c.c = 0;
break;
case 0: // '\0'
case 1: // '\001'
case 2: // '\002'
byte byte0 = 0;
switch (x)
{
case 0: // '\0'
byte0 = 0;
break;
case 1: // '\001'
byte0 = 1;
break;
case 2: // '\002'
byte0 = 2;
break;
}
d_int_array1d[byte0] = (p * a_b.d) / 10;
if (d_int_array1d[byte0] < 1)
d_int_array1d[byte0] = 1;
r.a_s_array1d_static[byte0].h += d_int_array1d[byte0];
if (r.a_s_array1d_static[byte0].h > r.a_s_array1d_static[byte0].f)
r.a_s_array1d_static[byte0].h = r.a_s_array1d_static[byte0].f;
break;
}
v = 1;
a_u.a(0, a_int_array1d[0], a_int_array1d[1]);
C = 0;
D = 0;
A = 0;
b_boolean = false;
}
}
private void h()
{
a_u.j += 4;
if (a_u.j > 0)
{
v = 7;
b_boolean = false;
r.c();
}
}
private void i()
{
if (F > 0 || F == -2)
{
G++;
if (G >= 7)
{
G = 0;
F = 0;
}
}
for (int i1 = 0; i1 < d_int_array1d.length; i1++)
{
if (d_int_array1d[i1] <= 0)
continue;
e_int_array1d[i1]++;
if (e_int_array1d[i1] >= 7)
{
e_int_array1d[i1] = 0;
d_int_array1d[i1] = 0;
}
}
}
public void d()
{
b_boolean = true;
a_u.a(4, a_int_array1d[0], a_int_array1d[1]);
}
private void j()
{
b_boolean = true;
if (a_u.a != 4)
a_u.a(4, a_int_array1d[0], a_int_array1d[1]);
E--;
if (E <= 0)
{
v = w;
b_boolean = false;
}
}
private void k()
{
if (F != -1 && F != -2 && a_u.a != 1)
v = 17;
else
if ((F == -1 || F == -2) && a_u.a != 2)
{
v = 17;
} else
{
byte byte0 = 2;
int i1 = 4;
if (a_u.e == byte0)
switch (x)
{
default:
break;
case -2:
if (F != -1)
{
if (n.c_boolean_static)
r.a_k_static.c();
j.O = j.N;
j.N = 5;
j.o();
j.Y = i1;
a_boolean = false;
if (n.a(0, 99) < t)
{
a_boolean = true;
F = (o - (j.B + j.C)) * 2;
} else
{
F = o - (j.B + j.C);
}
if (F < 1)
F = 1;
j.k -= F;
if (j.k < 0)
j.k = 0;
} else
{
F = -2;
}
break;
case -1:
if (F != -1)
{
if (n.c_boolean_static)
r.a_k_static.c();
c.r = c.q;
c.q = 5;
c.g();
c.A = i1;
a_boolean = false;
if (n.a(0, 99) < t)
{
a_boolean = true;
F = (o - c.l) * 2;
} else
{
F = o - c.l;
}
if (F < 1)
F = 1;
c.c -= F;
if (c.c < 0)
c.c = 0;
} else
{
F = -2;
}
break;
}
}
}
private void l()
{
switch (x)
{
default:
break;
case -2:
if (a_int_array1d[0] > r.a_int_array1d_static[0] + r.a_int_array2d_static[b_int][0])
a_int_array1d[0] -= ((r.b_int_array1d_static[0] - r.a_int_array2d_static[b_int][0]) + H) / 4;
if (a_int_array1d[1] > r.a_int_array1d_static[1] + r.a_int_array2d_static[b_int][1])
a_int_array1d[1] -= (r.b_int_array1d_static[1] - r.a_int_array2d_static[b_int][1]) / 4;
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -