Anagrams

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

using namespace std;


int main() {
    int n;
    cin >> n;

    map<string, vector<string>> anagrams;

    for (int i = 0; i < n;) {
        string word;
        getline(cin, word);

        if (word.size() > 0) {
            string word_sorted = word;
            sort(word_sorted.begin(), word_sorted.end());

            anagrams.emplace(word_sorted, vector<string>());
            anagrams[word_sorted].push_back(word);
            i++;
        }
    }

    int size = 0;
    for (auto & pair : anagrams) {
        size += pair.second.size() > 1;
    }

    cout << size << endl;

    for (auto& pair : anagrams) {
        if (pair.second.size() > 1) {
            cout << pair.second.size() << endl;
            for (auto& word : pair.second) {
                cout << word << endl;
            }
        }
    }

    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