Submission #62084231

Source Code Expand

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
#include <iostream>
#include <set>
#include <vector>
using namespace std;
typedef long long sll;
typedef struct row {
  sll counts[12];
  sll cxor() {
    sll ans = 0;
    for (int i = 0; i < 12; i++) {
      ans ^= counts[i];
    }
    return ans;
  }
} row;
sll A[12];
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

#include <iostream>
#include <set>
#include <vector>
using namespace std;

typedef long long sll;

typedef struct row {
  sll counts[12];

  sll cxor() {
    sll ans = 0;
    for (int i = 0; i < 12; i++) {
      ans ^= counts[i];
    }
    return ans;
  }
} row;

sll A[12];

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);

  int N;
  cin >> N;
  for (int i = 0; i < N; i++) {
    cin >> A[i];
  }

  vector<row> vec;
  vec.push_back({});
  int s = 0, e = 1;
  for (int i = 0; i < N; i++) {
    for (int r = s; r < e; r++) {
      for (int j = 0; j <= i; j++) {
        row rw = vec[r];
        rw.counts[j] += A[i];
        vec.push_back(rw);
      }
    }
    s = e;
    e = vec.size();
  }

  set<sll> st;
  for (int i = s; i < e; i++) {
    st.insert(vec[i].cxor());
  }

  cout << st.size() << '\n';

  return 0;
}

Submission Info

Judge Result