Sanalista

#include <bits/stdc++.h>
 
using namespace std;
 
int main() {
	int numw, pwords;
	pwords = 0;
	cin >> numw;
	for (int i = 1; i <= numw; i++)
	{
		string cword;
		cin >> cword;
		
		sort(cword.begin(), cword.end());	
		int len = cword.size();
		
		bool allpaired = true;
		
		if (len % 2 == 0)
		{
			
			for (int j = 0; j < len; j += 2)
			{
				if ((char)cword.at(j) != (char)cword.at(j+1))
				{
					allpaired = false;
					j = 99;
				}
			}
			if (allpaired)
			{
				pwords++;
			}
		}
	}	
	cout << pwords;
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED