c.java

泡泡龙游戏原代码

// Decompiled by DJ v2.9.9.60 Copyright 2000 Atanas Neshkov  Date: 2003-8-12 2:40:57
// Home Page : http://members.fortunecity.com/neshkov/dj.html  - Check often for new version!
// Decompiler options: packimports(3) 

package com.whkjava.popo;

import java.util.Random;

public final class c
{

    public c()
    {
    }

    private static int a()
    {
        _mthdo();
        if(_fldbyte == 32)
            _fldbyte = 1;
        int i;
        do
            i = (_flddo.nextInt() >>> 1) % 6 + 1;
        while((_fldbyte & 1 << i - 1) == 0);
        return i;
    }

    private static void _mthfor()
    {
        boolean flag = false;
        boolean flag1 = false;
        boolean flag2 = false;
        for(int i = 0; i < 10; i++)
        {
            int j = 0;
            if(_fldnew[5 + 6 * i] == -1)
                j = 1;
            for(int k = 0; k < 6; k++)
            {
                int l = k + 6 * i;
                int i1 = _fldnew[l] & 0xf;
                if(_fldnew[l] <= 0 || i1 <= 0)
                    continue;
                if(k == 0)
                {
                    int j1 = _fldnew[l + 1] & 0xf;
                    if(j1 > 0)
                        _fldnew[l] = _fldnew[l] | 0x40000;
                    if(j1 == i1)
                        _fldnew[l] = _fldnew[l] | 0x400;
                    if(i != 9)
                    {
                        int i2 = _fldnew[l + 6 + j] & 0xf;
                        if(i2 > 0)
                            _fldnew[l] = _fldnew[l] | 0x80000;
                        if(i2 == i1)
                            _fldnew[l] = _fldnew[l] | 0x800;
                        if(j > 0)
                        {
                            int k3 = _fldnew[l + 6] & 0xf;
                            if(k3 > 0)
                                _fldnew[l] = _fldnew[l] | 0x100000;
                            if(k3 == i1)
                                _fldnew[l] = _fldnew[l] | 0x1000;
                        }
                    }
                    if(i <= 0)
                        continue;
                    int j2 = _fldnew[(l - 6) + j] & 0xf;
                    if(j2 > 0)
                        _fldnew[l] = _fldnew[l] | 0x20000;
                    if(j2 == i1)
                        _fldnew[l] = _fldnew[l] | 0x200;
                    if(j <= 0)
                        continue;
                    int l3 = _fldnew[l - 6] & 0xf;
                    if(l3 > 0)
                        _fldnew[l] = _fldnew[l] | 0x10000;
                    if(l3 == i1)
                        _fldnew[l] = _fldnew[l] | 0x100;
                    continue;
                }
                if(j > 0 && k == 4 || j == 0 && k == 5)
                {
                    int k1 = _fldnew[l - 1] & 0xf;
                    if(k1 > 0)
                        _fldnew[l] = _fldnew[l] | 0x200000;
                    if(k1 == i1)
                        _fldnew[l] = _fldnew[l] | 0x2000;
                    if(i != 9)
                    {
                        int k2 = _fldnew[l + 5 + j] & 0xf;
                        if(k2 > 0)
                            _fldnew[l] = _fldnew[l] | 0x100000;
                        if(k2 == i1)
                            _fldnew[l] = _fldnew[l] | 0x1000;
                        if(j > 0)
                        {
                            int i4 = _fldnew[l + 6 + j] & 0xf;
                            if(i4 > 0)
                                _fldnew[l] = _fldnew[l] | 0x80000;
                            if(i4 == i1)
                                _fldnew[l] = _fldnew[l] | 0x800;
                        }
                    }
                    if(i <= 0)
                        continue;
                    int l2 = _fldnew[(l - 7) + j] & 0xf;
                    if(l2 > 0)
                        _fldnew[l] = _fldnew[l] | 0x10000;
                    if(l2 == i1)
                        _fldnew[l] = _fldnew[l] | 0x100;
                    if(j <= 0)
                        continue;
                    int j4 = _fldnew[(l - 6) + j] & 0xf;
                    if(j4 > 0)
                        _fldnew[l] = _fldnew[l] | 0x20000;
                    if(j4 == i1)
                        _fldnew[l] = _fldnew[l] | 0x200;
                    continue;
                }
                int l1 = _fldnew[l + 1] & 0xf;
                if(l1 > 0)
                    _fldnew[l] = _fldnew[l] | 0x40000;
                if(l1 == i1)
                    _fldnew[l] = _fldnew[l] | 0x400;
                l1 = _fldnew[l - 1] & 0xf;
                if(l1 > 0)
                    _fldnew[l] = _fldnew[l] | 0x200000;
                if(l1 == i1)
                    _fldnew[l] = _fldnew[l] | 0x2000;
                if(i != 9)
                {
                    int i3 = _fldnew[l + 6 + j] & 0xf;
                    if(i3 > 0)
                        _fldnew[l] = _fldnew[l] | 0x80000;
                    if(i3 == i1)
                        _fldnew[l] = _fldnew[l] | 0x800;
                    i3 = _fldnew[l + 5 + j] & 0xf;
                    if(i3 > 0)
                        _fldnew[l] = _fldnew[l] | 0x100000;
                    if(i3 == i1)
                        _fldnew[l] = _fldnew[l] | 0x1000;
                }
                if(i <= 0)
                    continue;
                int j3 = _fldnew[(l - 6) + j] & 0xf;
                if(j3 > 0)
                    _fldnew[l] = _fldnew[l] | 0x20000;
                if(j3 == i1)
                    _fldnew[l] = _fldnew[l] | 0x200;
                j3 = _fldnew[(l - 7) + j] & 0xf;
                if(j3 > 0)
                    _fldnew[l] = _fldnew[l] | 0x10000;
                if(j3 == i1)
                    _fldnew[l] = _fldnew[l] | 0x100;
            }

        }

    }

    public static void _mthtry()
    {
        _fldbyte = 0;
        _fldint = 0;
        _flddo = new Random();
        _fldnew = new int[60];
        _fldvoid = 0;
        int i = 11;
        for(int j = 0; j < 60; j++)
        {
            if(j < 18)
            {
                _fldnew[j] = (_flddo.nextInt() >>> 1) % 3 + 1;
                _fldvoid++;
            } else
            {
                _fldnew[j] = 0;
            }
            if(j != i)
                continue;
            if(_fldnew[j] != 0)
                _fldvoid--;
            _fldnew[j] = -1;
            i += 12;
        }

        _mthfor();
        _fldlong = a();
    }

    public static void _mthbyte()
    {
        _fldtry = 24;
        _fldfor = 80;
        _fldgoto = _fldtry * 1000;
        _fldelse = _fldfor * 1000;
        _fldnull = _fldlong;
        _fldlong = a();
    }

    public static int _mthnew()
    {
        byte byte0 = 2;
        int i = _fldif[a];
        int j = b[a];
        _fldgoto += 1 * i;
        _fldelse += 1 * j;
        _fldtry = _fldgoto / 1000;
        _fldfor = _fldelse / 1000;
        _fldcase = _fldfor / 8;
        int k;
        if(_fldnew[5 + 6 * _fldcase] == -1)
        {
            k = 1;
            _fldchar = (_fldtry - 4) / 8;
        } else
        {
            k = 0;
            _fldchar = _fldtry / 8;
        }
        int l = _fldchar + 6 * _fldcase;
        if(a != 21 && (_fldchar > 0 && _fldchar < 5 - k && _fldnew[l - 1] > 0 && _fldnew[l + 1] > 0 || k == 0 && _fldchar == 0 && _fldnew[l + 1] > 0 || k == 0 && _fldchar == 5 && _fldnew[l - 1] > 0))
        {
            _fldnew[l] = _fldnull;
            _mthfor();
            _fldvoid++;
            return 0;
        }
        int i1 = _fldtry + 1;
        int j1 = _fldtry - 1;
        int k1 = 45;
        byte byte1 = 3;
        if(i1 > k1 || j1 < byte1)
        {
            if(i1 > k1)
                _fldtry = k1;
            if(j1 < byte1)
                _fldtry = byte1 + 1;
            a = 42 - a;
            i = _fldif[a];
            j = b[a];
            byte0 = 1;
        }
        if(_fldfor - 1 < 7)
        {
            _fldfor = 4;
            _fldcase = _fldfor / 8;
            if(_fldnew[5 + 6 * _fldcase] == -1)
                _fldchar = (_fldtry - 4) / 8;
            else
                _fldchar = _fldtry / 8;
            l = _fldchar + 6 * _fldcase;
            _fldnew[l] = _fldnull;
            _mthfor();
            _fldvoid++;
            return 0;
        }
        l = _fldchar + 6 * _fldcase;
        int l1 = (_fldelse + 1 * j) / 1000 / 8;
        int i2;
        if(_fldnew[5 + 6 * l1] == -1)
            i2 = ((_fldgoto + 1 * i) / 1000 - 4) / 8;
        else
            i2 = ((_fldgoto + 1 * i) / 1000 - 0) / 8;
        int j2 = i2 + 6 * l1;
        if(_fldnew[j2] > 0)
        {
            if(_fldnew[l] == -1)
            {
                if(_fldnew[l - 1] > 0)
                {
                    _fldcase++;
                    _fldnew[l + 6] = _fldnull;
                } else
                {
                    _fldchar--;
                    _fldnew[l - 1] = _fldnull;
                }
            } else
            {
                _fldnew[l] = _fldnull;
            }
            _mthfor();
            _fldvoid++;
            return 0;
        }
        if(j2 > 0 && j2 < 59)
        {
            if((l + 1) % 6 == 0 || l % 6 == 0)
                return byte0;
            if(a == 21 && (_fldnew[j2 - 1] > 0 || _fldnew[j2] > 0))
            {
                if(_fldnew[5 + 6 * _fldcase] == -1 && j2 == (l - 6) + 1 || _fldnew[5 + 6 * _fldcase] != -1 && j2 == l - 6)
                {
                    _fldnew[l] = _fldnull;
                    _mthfor();
                    _fldvoid++;
                    return 0;
                }
            } else
            if(a > 21 && _fldnew[j2] > 0)
            {
                if(_fldnew[5 + 6 * _fldcase] == -1 && j2 == (l - 6) + 1 || _fldnew[5 + 6 * _fldcase] != -1 && j2 == l - 6)
                {
                    _fldnew[l] = _fldnull;
                    _mthfor();
                    _fldvoid++;
                    return 0;
                }
            } else
            if(a > 21 && _fldnew[j2 - 1] > 0 && _fldnew[l + 1] > 0)
            {
                if(_fldnew[5 + 6 * _fldcase] == -1 && j2 == (l - 6) + 1 || _fldnew[5 + 6 * _fldcase] != -1 && j2 == l - 6)
                {
                    _fldnew[l] = _fldnull;
                    _mthfor();
                    _fldvoid++;
                    return 0;
                }
            } else
            if(a > 21 && _fldnew[j2 - 1] > 0 && _fldnew[j2 + 1] > 0)
            {
                if(_fldnew[5 + 6 * _fldcase] == -1 && j2 == (l - 6) + 1 || _fldnew[5 + 6 * _fldcase] != -1 && j2 == l - 6)
                {
                    _fldnew[j2] = _fldnull;
                    _fldcase = l1;
                    _fldchar = i2;
                    _mthfor();
                    _fldvoid++;
                    return 0;
                }
            } else
            if(a < 21 && _fldnew[j2] > 0)
            {
                if(_fldnew[5 + 6 * _fldcase] == -1 && j2 == l - 6 || _fldnew[5 + 6 * _fldcase] != -1 && j2 == l - 6 - 1)
                {
                    _fldnew[l] = _fldnull;
                    _mthfor();
                    _fldvoid++;
                    return 0;
                }
            } else
            if(a < 21 && _fldnew[j2 + 1] > 0 && _fldnew[l - 1] > 0)
            {
                if(_fldnew[5 + 6 * _fldcase] == -1 && j2 == l - 6 || _fldnew[5 + 6 * _fldcase] != -1 && j2 == l - 6 - 1)
                {
                    _fldnew[l] = _fldnull;
                    _mthfor();
                    _fldvoid++;
                    return 0;
                }
            } else
            if(a < 21 && _fldnew[j2 + 1] > 0 && _fldnew[j2 - 1] > 0 && (_fldnew[5 + 6 * _fldcase] == -1 && j2 == l - 6 || _fldnew[5 + 6 * _fldcase] != -1 && j2 == l - 6 - 1))
            {
                _fldnew[j2] = _fldnull;
                _fldcase = l1;
                _fldchar = i2;
                _mthfor();
                _fldvoid++;
                return 0;
            }
        }
        if(_fldchar > 0 && _fldchar < 5 - k && a > 21)
        {
            int k2;
            if(_fldnew[5 + 6 * _fldcase] == -1)
                k2 = _fldtry - 4;
            else
                k2 = _fldtry - 0;
            if(k2 % 8 >= 5 && k2 % 8 <= 7 && _fldnew[l + 1] > 0)
            {
                _fldnew[l] = _fldnull;
                _mthfor();
                _fldvoid++;
                return 0;
            }
        } else
        if(_fldchar > 0 && _fldchar < 5 - k && a < 21)
        {
            int l2;
            if(_fldnew[5 + 6 * _fldcase] == -1)
                l2 = _fldtry - 4;
            else
                l2 = _fldtry - 0;
            if(l2 % 8 >= 0 && l2 % 8 <= 2 && _fldnew[l - 1] > 0)
            {