Submission #62094016

---

Source Code Expand

import java.util.*;
import java.lang.*;
import java.io.*;
import java.math.*;

public class Main {
    static long arr[] = null;
    static HashSet<Long> hash = new HashSet<>();
    static HashSet<String> hashCheck = new HashSet<>();

    static void solve(int index) {
        if (arr[index] == 0) {
            return;
        }
        String mask = "";
        long k = 0;
        for (int i = 0; i < arr.length; i++) {
            k ^= arr[i];
            // mask += arr[i] + ",";
        }
        hash.add(k);
        // if (hashCheck.contains(mask)) {
        // return;
        // }
        // hashCheck.add(mask);

        long temp = arr[index];
        for (int i = index + 1; i < arr.length; i++) {
            if (temp == 0 || arr[i] == 0) {
                continue;
            }
            arr[i] += temp;
            arr[index] = 0;
            for (int o = 0; o < arr.length; o++) {
                solve(o);
            }
            arr[i] -= temp;
            arr[index] = temp;
        }
    }

    public static void main(String[] args) throws java.lang.Exception {
        Scanner s = new Scanner(System.in);
        int n = s.nextInt();
        String mask = "";
        arr = new long[n];
        for (int i = 0; i < n; i++) {
            long k = s.nextLong();
            arr[i] = k;
            mask += k + ",";
        }
        // solve(0);
        for (int i = 0; i < n; i++) {
            // hashCheck = new HashSet<>();
            hashCheck.remove(mask);
            solve(i);
        }
        // System.out.println(mask);
        System.out.println(hash.size());

    }
}

Submission Info

Judge Result