Submission #2531238

---

Source Code Expand

#include <iostream>
#include <set>
#include <algorithm>

using namespace std;

#define rep(i,n) for(int i=0;i<n;i++)

int A[100010];

int main() {
    int N;
    cin >> N;
    rep(i, N)cin >> A[i];

    set<int>st;

    rep(i, N) {
        if (st.find(A[i]) == st.end()) {
            st.insert(A[i]);
        }
        else {
            st.erase(A[i]);
        }
    }
    cout << st.size() << endl;
}

Submission Info

Judge Result