Model Solution of GEEK03

geek03.cpp

#include <bits/stdc++.h>
using namespace std;

int main() {
	ios_base::sync_with_stdio(false);
	int t, n;
	cin >> t;
	assert(1 <= t && t <= 10);
	while(t--) {
		cin >> n;
		assert(1 <= n && n <= 100);
		vector<string> a(n);
		for(int i = 0; i < n; ++i) {
			cin >> a[i];
			assert(a[i].length() <= 10);
		}
		sort(a.begin(), a.end());
		int ans = 0;
		for(int i = 0; i < n; ++i) {
			int j = i;
			while(j < n && a[i] == a[j]) {
				j += 1;
			}
			if ((j - i) % 2 == 1) {
				ans += 1;
			}
			i = j - 1;
		}
		cout << ans << "\n";
	}
	return 0;
}