Submission #2864774

---

Source Code Expand

#include <iostream>
#include <string>
#include <vector>
#include <cstdlib>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <map>
#include <stack>
#include <queue>
#include <set>
#include <cstring>

using namespace std;
// ascending order
#define vsort(v) sort(v.begin(), v.end())
// descending order
#define vsort_r(v) sort(v.begin(), v.end(), greater<int>())
// ascending order
#define asort(array, N) sort(array, array + N)
// descending order
#define asort_r(array, N) sort(array, array + N, greater<int>())
#define vunique(v) v.erase(unique(v.begin(), v.end()), v.end())
#define mp make_pair
#define ts(x) to_string(x)
typedef long long ll;
typedef pair<int, int> P;
const ll INF = 1e18;

ll N;
vector<ll> d;
int main(){
	cin.tie(0);
	ios::sync_with_stdio(false);

	cin >> N;
	for(int i = 0; i < N; i++) {
		ll a;
		cin >> a;
		d.push_back(a);
	}
	vsort(d);
	int i = 0;
	int ans = 0;
	while(i < d.size()) {
		int tmp = d[i];
		int j = i;
		int count = 0;
		while(true) {
			if(tmp == d[j]) {
				count++;
				j++;
				continue;
			} 
			break;
		}
		i = j;
		if(count % 2 != 0) ans++;
	}
	cout << ans << endl;
}

Submission Info

Judge Result