Anagrams

#include <iostream>
#include <algorithm>
#include <string>
#include <functional>
#include <bits/stdc++.h>
#define N 1000000
using namespace std;
using llu = long long signed;

map<size_t, vector<string>> m;

int main()
{
    llu n;

    string s;
    
    cin >> n;

    for (llu i = 0;i<n;++i){
        cin >> s;
        string ssorted = s;
        sort(ssorted.begin(), ssorted.end());
        auto asd = hash<string>{}(ssorted);
        
        if (m.find(asd) == m.end()) {
            m[asd] = vector<string>();
        }
        m[asd].push_back(s);
    }

    llu asd = 0;
    for (auto const& x : m)
    {
        if (x.second.size() >= 2) {
            asd+=1;
        }
    }
    std::cout << asd << endl;

    for (auto const& x : m)
    {
        if (x.second.size() < 2) {
            continue;
        }
        std::cout << x.second.size() << endl;

        for (auto const& y : x.second) {
            std::cout << y << endl;
        }
    }
    return 0;
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED