Anagrams

#include <bits/stdc++.h>
using namespace std;

int main() {
  int n;
  cin >> n;
  string s;
  unordered_map<string,vector<string>> dictionary;

  for (int i = 0; i < n; i++) {
    cin >> s;
    string s2 = s;
    sort(s2.begin(), s2.end());
    dictionary[s2].push_back(s);
  }

  n = 0;
  for (auto j: dictionary)
    if (j.second.size() > 1)
      n++;
  cout << n << endl;

  for (auto j: dictionary) {
    if (j.second.size() < 2)
      continue;
    cout << j.second.size() << endl;
    for (auto k: j.second) {
      cout << k << endl;
    }
  }
}

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