Sanalista

#include <bits/stdc++.h>
 
typedef long long ll;
 
#define M 1000000007
 
using namespace std;
 
int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	int n;
	cin >> n;
 
    int ans = 0;
 
	for (int y = 0; y < n; ++y) {
        string s;
        cin >> s;
        sort(s.begin(), s.end());
 
        int cur = 1;
        bool ok = true;
 
        for (int i = 1; i < (int)s.length(); ++i) {
            if (s[i-1] == s[i]) cur++;
            else {
                if (cur % 2 != 0) {
                    //cout << "broke " << s[i] << endl;
                    ok = false;
                    break;
                }
                cur = 1;
            }
        }
 
        if (ok) ans++;
 
        
	}
 
    cout << ans << endl;
 
	return 0;
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: WRONG ANSWER

Test 3

Verdict: WRONG ANSWER