Model Solution 2 of GEEK03

geek03-2.cpp

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

int main() {
	int t, n;
	string s;
	cin >> t;
	while(t--) {
		cin >> n;
		map<string, int> mp;
		for(int i = 0; i < n; ++i) {
			cin >> s;
			mp[s] += 1;
		}
		int ans = 0;
		for(auto it : mp) {
			if (it.second % 2 == 1) {
				ans += 1;
			}
		}
		cout << ans << "\n";
	}
	return 0;
}