📄 hqfsj_personbean.java
字号:
// Decompiled by DJ v3.7.7.81 Copyright 2004 Atanas Neshkov Date: 2006-10-19 15:28:50
// Home Page : http://members.fortunecity.com/neshkov/dj.html - Check often for new version!
// Decompiler options: packimports(3)
import java.util.Random;
public class Hqfsj_PersonBean
{
public Hqfsj_PersonBean(llkCanvas llkcanvas)
{
_fldnew = new int[3][13];
_fldchar = new byte[5];
_fldcase = new byte[15];
_fldint = new byte[5];
_fldfor = new byte[5];
_fldnull = llkcanvas;
}
public void g()
{
_mthif(_mthnew(), false);
_flddo++;
_fldelse += 20;
}
public int _mthnew()
{
if(_flddo == 0)
return 0x186a0;
if(_flddo == 1)
return 0x30d40;
if(_flddo == 2)
return 0x61a80;
if(_flddo == 3)
return 0xc3500;
return _flddo != 4 ? 0 : 0x124f80;
}
public void i()
{
_fldvoid = 1;
_fldgoto = 100;
a = 100;
b = 2000;
_fldlong = -5000;
_fldelse = 100;
_flddo = 0;
_mthnull();
_mthint();
}
public int _mthbyte()
{
int k = 0;
for(int l = 0; l < 15; l++)
if(_fldcase[l] >= 10)
k++;
return k;
}
public void _mthint()
{
for(int k = 0; k < 5; k++)
_fldchar[k] = 0;
for(int l = 0; l < 15; l++)
_fldcase[l] = 0;
for(int i1 = 0; i1 < 5; i1++)
_fldint[i1] = 0;
for(int j1 = 0; j1 < 5; j1++)
_fldfor[j1] = 0;
}
public void _mthif(int k, byte byte0)
{
if(k == 0)
{
int l = 0;
do
{
if(l >= 5)
break;
if(_fldchar[l] == 0)
{
_fldchar[l] = byte0;
break;
}
l++;
} while(true);
} else
if(k == 1)
{
int i1 = 0;
do
{
if(i1 >= 15)
break;
if(_fldcase[i1] == 0)
{
_fldcase[i1] = byte0;
break;
}
i1++;
} while(true);
} else
if(k == 2)
{
int j1 = 0;
do
{
if(j1 >= 5)
break;
if(_fldint[j1] == 0)
{
_fldint[j1] = byte0;
break;
}
j1++;
} while(true);
} else
if(k == 3)
{
int k1 = 0;
do
{
if(k1 >= 5)
break;
if(_fldfor[k1] == 0)
{
_fldfor[k1] = byte0;
break;
}
k1++;
} while(true);
}
_mthif();
}
public void a(int k, byte byte0)
{
if(k == 0)
_fldchar[byte0] = 0;
else
if(k == 1)
_fldcase[byte0] = 0;
else
if(k == 2)
_fldint[byte0] = 0;
else
if(k == 3)
_fldfor[byte0] = 0;
_mthif();
}
public boolean _mthchar(int k)
{
int l = 0;
for(int i1 = 0; i1 < 5; i1++)
if(_fldfor[i1] >= 10)
l++;
return l < k;
}
public void _mthcase()
{
for(int k = 0; k < 5; k++)
_fldint[k] = 0;
int l = 0;
do
{
if(l >= 5)
break;
byte byte0 = (byte)a(10, 23);
if(!a(byte0) && byte0 != 14 && byte0 != 21)
{
_mthif(2, byte0);
l++;
}
} while(true);
}
private boolean a(byte byte0)
{
for(int k = 0; k < 5; k++)
if(_fldint[k] == byte0)
return true;
return false;
}
public static int a(int k, int l)
{
int i1;
for(i1 = (_fldtry.nextInt() & 0x7fffffff) % (l + 1); i1 <= k; i1 = (_fldtry.nextInt() & 0x7fffffff) % (l + 1));
return i1;
}
public void _mthif()
{
for(int k = 0; k < 4; k++)
{
for(int k1 = 0; k1 < 4; k1++)
if(_fldchar[k1] < _fldchar[k1 + 1])
{
byte byte0 = _fldchar[k1];
_fldchar[k1] = _fldchar[k1 + 1];
_fldchar[k1 + 1] = byte0;
}
}
for(int l = 0; l < 14; l++)
{
for(int l1 = 0; l1 < 14; l1++)
if(_fldcase[l1] < _fldcase[l1 + 1])
{
byte byte1 = _fldcase[l1];
_fldcase[l1] = _fldcase[l1 + 1];
_fldcase[l1 + 1] = byte1;
}
}
for(int i1 = 0; i1 < 4; i1++)
{
for(int i2 = 0; i2 < 4; i2++)
if(_fldint[i2] < _fldint[i2 + 1])
{
byte byte2 = _fldint[i2];
_fldint[i2] = _fldint[i2 + 1];
_fldint[i2 + 1] = byte2;
}
}
for(int j1 = 0; j1 < 4; j1++)
{
for(int j2 = 0; j2 < 4; j2++)
if(_fldfor[j2] < _fldfor[j2 + 1])
{
byte byte3 = _fldfor[j2];
_fldfor[j2] = _fldfor[j2 + 1];
_fldfor[j2 + 1] = byte3;
}
}
}
public void _mthnull()
{
for(int k = 0; k < 3; k++)
{
for(int l = 0; l < 13; l++)
if(k == 0)
_fldnew[k][l] = 5000 + l + 1;
else
_fldnew[k][l] = 0;
}
}
public int[][] _mthdo()
{
return _fldnew;
}
public boolean _mthlong(int k)
{
return b >= k;
}
public void a(int k, int l, int i1)
{
if(_fldnew[1][k - 5001] == 0)
{
_fldnew[1][k - 5001] = l;
_fldnew[2][k - 5001] = i1;
} else
if(_fldnew[1][k - 5001] != 0)
{
_fldnew[1][k - 5001] = _fldnew[1][k - 5001] + l;
_fldnew[2][k - 5001] = (_fldnew[2][k - 5001] + i1) / 2;
}
if(k != 5009 && k != 5010 && k != 5011 && k != 5012 && k != 5013)
_mthif(l * i1, false);
}
public void _mthif(int k, int l, int i1)
{
if(k == 5007 && l > 0)
{
_mthbyte(f() / 10);
_fldnull.an._flddo = true;
_fldnull.B = true;
_fldnull.an.G = 50;
_fldnull.an.z = "\u51FA\u552E\u8FDD\u7981\u5546\u54C1\uFF0C\u4F60\u7684\u9053\u5FB7\u4E0B\u964D\u4E86\u3002";
}
if(k == 5008 && l > 0)
{
_mthbyte(7);
_fldnull.an._flddo = true;
_fldnull.B = true;
_fldnull.an.G = 50;
_fldnull.an.z = "\u51FA\u552E\u8FDD\u7981\u5546\u54C1\uFF0C\u4F60\u7684\u9053\u5FB7\u4E0B\u964D\u4E86\u3002";
}
_fldnew[1][k - 5001] = _fldnew[1][k - 5001] - l;
if(_fldnew[1][k - 5001] == 0)
_fldnew[2][k - 5001] = 0;
if(k != 5013)
_mthif(l * i1, true);
_mthlong();
}
public int _mthdo(int k)
{
return _fldnew[1][k - 5001];
}
public int _mthnew(int k)
{
return _fldnew[2][k - 5001];
}
public boolean _mthif(int k)
{
return _fldnew[1][k - 5001] != 0;
}
public void _mthcase(int k)
{
_fldvoid = _fldvoid + k;
if(_fldvoid > 80)
_fldvoid = 80;
}
public int _mthvoid()
{
return _fldvoid;
}
public void _mthtry(int k)
{
_fldelse = _fldelse + k;
}
public int b()
{
return _fldelse;
}
public void _mthif(int k, boolean flag)
{
if(flag)
b = b + k;
else
if(!flag)
{
b = b - k;
if(b < 0)
b = 0;
}
}
public int _mthfor()
{
return b;
}
public void a(int k, boolean flag)
{
if(k < 0)
k = -k;
if(flag)
_fldlong = _fldlong + k;
else
if(!flag)
_fldlong = _fldlong - k;
}
public int _mthtry()
{
return _fldlong;
}
public void _mthdo(int k, boolean flag)
{
if(flag)
{
_fldgoto = _fldgoto + k;
if(_fldgoto > 100)
_fldgoto = 100;
} else
if(!flag)
{
_fldgoto = _fldgoto - k;
if(_fldgoto < 0)
_fldgoto = 0;
}
}
public int _mthchar()
{
return _fldgoto;
}
public void _mthbyte(int k)
{
a = a - k;
if(a < 0)
a = 0;
}
public int f()
{
return a;
}
public int j()
{
int k = 0;
k = _fldelse - e();
return k;
}
public boolean _mthfor(int k)
{
for(int l = 0; l < 15; l++)
if(_fldcase[l] == k)
return true;
for(int i1 = 0; i1 < 5; i1++)
if(_fldchar[i1] == k)
return true;
return false;
}
public boolean _mthelse(int k)
{
for(int l = 0; l < 5; l++)
if(_fldchar[l] == k)
return true;
return false;
}
public boolean a(int k)
{
for(int l = 0; l < 5; l++)
if(_fldint[l] == k)
return true;
return false;
}
public void _mthgoto(int k)
{
for(int l = 0; l < 15; l++)
if(_fldcase[l] == k)
{
_fldcase[l] = 0;
_mthif();
return;
}
for(int i1 = 0; i1 < 5; i1++)
if(_fldchar[i1] == k)
{
_fldchar[i1] = 0;
_fldnull.a((byte)(k + 8), (byte)1, (byte)1);
_mthif();
return;
}
}
public int e()
{
int k = 0;
for(int l = 0; l < 8; l++)
k += _fldnew[1][l];
return k;
}
public void _mthlong()
{
for(int k = 0; k < 13; k++)
if(_fldnew[1][k] == 0)
{
_fldnew[1][k] = 0;
_fldnew[2][k] = 0;
}
}
public void d()
{
if(_mthtry() >= 0)
a(_mthtry() / 100, true);
else
if(_mthtry() < 0)
a(0 - _mthtry() / 10, false);
}
public int a()
{
int k = 0;
for(int l = 0; l < 13; l++)
if(_fldnew[1][l] != 0)
k++;
return k;
}
public int _mthint(int k)
{
int l = 0;
int i1 = 0;
do
{
if(i1 >= 13)
break;
if(_fldnew[1][i1] != 0)
l++;
if(i1 == k)
break;
i1++;
} while(true);
return l;
}
public void _mthgoto()
{
for(int k = 0; k < 8; k++)
b = b + _fldnew[1][k] * _fldnew[2][k];
}
public boolean h()
{
boolean flag = false;
int k = 8;
do
{
if(k >= 13)
break;
if(_fldnew[1][k] != 0)
{
flag = true;
break;
}
k++;
} while(true);
return flag;
}
public int c()
{
int k = 0;
for(int l = 8; l < 13; l++)
if(_fldnew[1][l] != 0)
k++;
return k;
}
public void _mthelse()
{
for(int k = 0; k < 12; k++)
{
if(_fldnew[1][k] == 0)
continue;
if(_fldnew[1][k] == 1)
_fldnew[1][k] = 0;
else
_fldnew[1][k] = _fldnew[1][k] / 2;
}
_fldnew[1][12] = 1 + (_fldnew[1][12] - 1) / 2;
}
private int _fldvoid;
private int _fldgoto;
private int a;
private int b;
private int _fldlong;
private int _fldelse;
public int _flddo;
private static Random _fldtry = new Random(System.currentTimeMillis());
public int _fldnew[][];
public byte _fldchar[];
public byte _fldcase[];
public byte _fldint[];
public byte _fldfor[];
llkCanvas _fldnull;
public static int _fldif[][] = {
{
40000, 1000
}, {
40000, 1000
}, {
0x13880, 1000
}, {
20000, 1000
}, {
0x186a0, 1000
}, {
50000, 1000
}, {
50000, 1000
}, {
50000, 1000
}, {
50000, 1000
}, {
50000, 1000
}, {
50000, 1000
}, {
50000, 5000
}, {
50000, 1000
}, {
60000, 1000
}
};
public static int _fldbyte[][] = {
{
1, 51
}, {
80, 250
}, {
150, 400
}, {
300, 800
}, {
700, 1300
}, {
15000, 30000
}, {
1000, 4000
}, {
5000, 15000
}
};
}⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -