2023第十四届蓝桥杯Java省赛(与或异或)

public class Main {
    static int ans = 0;
    public static void main(String[] args) {
        int[][] arr = new int[5][5];
        arr[0][0] = 1;
        arr[0][1] = 0;
        arr[0][2] = 1;
        arr[0][3] = 0;
        arr[0][4] = 1;
        dfs(arr, 0, 0);
        System.out.println(ans);
    }

    public static void dfs(int[][] arr, int x, int y) {
        if (x == 4) {
            if (arr[4][0] == 1) ans++;
            return;
        }
        for (int i = 0; i < 3; i++) {
            if (i == 0) {
                arr[x + 1][y] = arr[x][y] & arr[x][y + 1];
            } else if (i == 1) {
                arr[x + 1][y] = arr[x][y] | arr[x][y + 1];
            } else {
                arr[x + 1][y] = arr[x][y] ^ arr[x][y + 1];
            }

            if (y == 3 - x) dfs(arr, x + 1, 0);
            else dfs(arr, x, y + 1);
        }
    }

}