设计到算数的问题，求解答

Question

有这样一段java代码

    public static void main(String[] args) {
        int state = 8688201;
        int index = 101;
        for (int i = 1; i < 11; i++) {
            int a1 = state & ((int) Math.pow(8, ((index * 10 + i - 1) % 10)) * 7);
            int a2 = (int) Math.pow(8, ((index * 10 + i - 1) % 10));
            int stateDecode = a1 / a2;
            System.out.println("index:" + (index * 10 + i) + ",stateDecode:" + stateDecode);
        }

    }

可以得到1011到1020的stateDecode，运行结果：

index:1011,stateDecode:1
index:1012,stateDecode:1
index:1013,stateDecode:1
index:1014,stateDecode:1
index:1015,stateDecode:1
index:1016,stateDecode:1
index:1017,stateDecode:1
index:1018,stateDecode:4
index:1019,stateDecode:0
index:1020,stateDecode:0

反之，要是已知1011到1020的stateDecode，如何得到state？

Answer 1

你好 可以得到答案了 有啥看不懂的问

package Answer7731784;

import java.util.Arrays;
import java.util.HashMap;

public class Answeer7731784 {
    public static void main(String[] args) {
        int state = 8688201;
        int index = 101;
        HashMap<Integer, Integer> hm = new HashMap<>();

        for (int i = 1; i < 11; i++) {
            int a1 = state & ((int) Math.pow(8, ((index * 10 + i - 1) % 10)) * 7);

            int a2 = (int) Math.pow(8, ((index * 10 + i - 1) % 10));
            int stateDecode = a1 / a2;
            System.out.println("index:" + (index * 10 + i) + ",stateDecode:" + stateDecode);
            hm.put((index * 10 + i), stateDecode);

        }
        int getState = getState(index, hm);
        System.out.println("state="+getState);
    }

    private static int getState(int index, HashMap<Integer, Integer> hm) {
        System.out.println("输入原有的10个映射关系");
        System.out.println(hm);
        System.out.println("开始运算：");
        int[] arry = new int[11];
        boolean flag = true;
        int getState = 0;
        while (flag) {
            int count = 1;
            for (int i = 1; i < 11; i++) {
                int stateD = hm.get(index * 10 + i);
                int a2 = (int) Math.pow(8, ((index * 10 + i - 1) % 10));
                int a1 = stateD * a2;
                while (true) {
                    int a = getState & ((int) Math.pow(8, ((index * 10 + i - 1) % 10)) * 7);
                    if (a == a1) {
                        arry[i] = getState;
                        break;
                    }
                    getState++;
                }
            }
            System.out.println(Arrays.toString(arry));
            for (int i = 1; i < 10; i++) {
                if (arry[i] == arry[i + 1]) {
                    count++;
                }
            }
            if(count==10)
                flag=false;
            
        }
        System.out.println("得到结果： ");
        return getState;
    }

}