Anagrams

#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

long long h(std::string s) {
    long long m = 0;
    int t = 1000;
    for (auto c: s) {
        m += c*t;
    }
    return m;
}

bool comp(string s1, string s2) {
    return h(s1) < h(s2);
}

int main() {
    int n;

    cin >> n;

    vector<string> sanat = vector<string>();

    for (int i = 0; i < n; i++) {
        string s;
        cin >> s;
        sanat.push_back(s);
    }

    sort(sanat.begin(), sanat.end(), comp);

    long long v0 = h(sanat[0]);
    int m = 0;
    int s = 0;

    for (int i = 1; i < n; i++) {
        long long v = h(sanat[i]); 
        if (v != v0) {
            v0 = v;
            s = 0;
        } else {
            if (!s) {
                s = 1;
                m += 1;
            }
        }
    }

    cout << m << endl;

    v0 = h(sanat[0]);
    int f = 1;
    for (int i = 1; i < n; i++) {
        long long v = h(sanat[i]); 
        if (v != v0) {
            v0 = v;
            if (f > 1) {
                cout << f << endl;
                for (int j = i - f; j < i; j++)
                    cout << sanat[j] << endl;
            }
            f = 1;
        } else {
            f += 1;
        }
    }
    if (f > 1) {
        cout << f << endl;
        for (int j = n - f; j < n; j++)
            cout << sanat[j] << endl;
    }

    return 0;
}

Test 1

Verdict: WRONG ANSWER

Test 2

Verdict: WRONG ANSWER

Test 3

Verdict: WRONG ANSWER

Test 4

Verdict: WRONG ANSWER

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED