Anagrams

#include <iostream>
#include <string>
#include <map>
#include <algorithm>
#include <vector>

using namespace std;

int n;
map<string, vector<string>> mp;

int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cin >> n;
	for (int i = 0; i < n; ++i) {
		string cs;
		cin >> cs;
		string ss = cs;
		sort(ss.begin(), ss.end());
		mp[ss].push_back(cs);
	}
	vector<string> rk;
	for (auto a : mp) {
		if (a.second.size() > 1) {
			rk.push_back(a.first);
		}
	}

	cout << rk.size() << "\n";
	for (auto ck : rk) {
		vector<string> cv = mp[ck];
		cout << cv.size() << "\n";
		for (auto cs : cv) {
			cout << cs << "\n";
		}
	}
	return 0;
}

Test 1

Verdict: UNKNOWN

Test 2

Verdict: UNKNOWN

Test 3

Verdict: UNKNOWN

Test 4

Verdict: UNKNOWN

Test 5

Verdict: UNKNOWN

Test 6

Verdict: UNKNOWN

Test 7

Verdict: UNKNOWN

Test 8

Verdict: UNKNOWN

Test 9

Verdict: UNKNOWN