Anagrams

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

using namespace std;

int main(){
	unsigned int n;
	string str;

	cin >> n;
	vector<string> words;
	vector<pair<int,int> > hashes;

	for(unsigned int i = 0; i < n; i++){
		cin >> str;
		words.push_back(str);
		pair<int,int> p (0, i);
		for(unsigned int j = 0; j < str.length(); j++){
			p.first += (str[j] - 'A' + 1) * 36;
		}
		hashes.push_back(p);
	}

	sort(hashes.begin(), hashes.end());
/*
	for(unsigned int i = 0; i < n; i++){
		cout << hashes[i].first << "," << hashes[i].second << "\n";
	}
*/

	int total = 0;

	for(unsigned int i = 0; i < n - 1;){
		int j = i + 1;
		if(hashes[i].first == hashes[j].first){
			total++;
		}
		while(hashes[i].first == hashes[j].first) j++;	
		i = j;
	}

	cout << total << "\n";

	int prev = -1;
	int counter = 1;
	for(unsigned int i = 0; i < n; i++){
		if(hashes[i].first == prev){
			counter++;
		} else if(counter > 1){
			cout << counter << "\n";
			for(int j = 1; j <= counter; j++){
				cout << words[hashes[i - j].second] << "\n";
			}
			counter = 1;
		}
		prev = hashes[i].first;
	}

	if(counter > 1){
		cout << counter << "\n";
		for(int j = 1; j <= counter; j++){
			cout << words[hashes[n - j].second] << "\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