Sanalista

#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
using namespace std;
 
int main()
{
	int n = 0; cin >> n;
	int ans = n;
	vector<string> sanat;
	string temp = "";
	for(int i = 0; i < n; i++)
	{
		cin >> temp;
		if(temp.size() % 2 != 0)
		{
			ans--;
			continue;
		}
		sort(temp.begin(), temp.end()); // maybe sort each word and then check for letter amounts
		sanat.push_back(temp);
	}
	n = ans;
	for(int i = 0; i < n; i++)
	{
		char prev = ' ';
		for(char c : sanat[i])
		{
			if(prev == ' ')
			{
				prev = c;
				continue;
			}
			if(c==prev)
			{
				prev = ' ';
				continue;
			}
			else
			{
				ans--;
				break;
			}
		}
	}
	cout << ans << '\n';
	return 0;
}
 

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED