Submission #3049651

---

Source Code Expand

#include<iostream>
#include<set>
using ll = long long;
using namespace std;
int main(){
    ll n,a;
    set<ll> s;
    cin >> n;
    for(int i=0;i<n;i++){
        cin >> a;
        if(s.find(a)==s.end())  s.insert(a);
        else    s.erase(a);
    }
    cout << s.size() << endl;
    return 0;
}

Submission Info

Judge Result