Submission #62199108

---

Source Code Expand

use std::collections::BTreeSet;
use itertools::Itertools;
use proconio::input;

fn dfs(v: &mut Vec<u64>, i: usize, a: &Vec<u64>, ans: &mut Vec<u64>) {
    if i == a.len() {
        ans.push(v.iter().fold(0, |acc, &x| acc ^ x));
        return;
    }

    for j in 0..v.len() {
        v[j] += a[i];
        dfs(v, i + 1, a, ans);
        v[j] -= a[i];
    }
    v.push(a[i]);
    dfs(v, i + 1, a, ans);
    v.pop();
}

fn main() {
    input! {
        n: usize,
        a: [u64; n],
    }

    let mut ans = Vec::new();
    dfs(&mut Vec::new(), 0, &a, &mut ans);
    println!("{}", ans.iter().sorted_unstable().dedup().count());
}

Submission Info

Compile Error

warning: unused import: `std::collections::BTreeSet`
 --> src/main.rs:1:5
  |
1 | use std::collections::BTreeSet;
  |     ^^^^^^^^^^^^^^^^^^^^^^^^^^
  |
  = note: `#[warn(unused_imports)]` on by default

Judge Result