UVa 10887 - Concatenation of Languages

#include <algorithm>
#include <iostream>
#include <cstdlib>
#include <cstring>
#include <cstdio>
#include <map>

using namespace std;

string set1[1501], set2[1501];

int main()
{
	int T, N, M;
	cin >> T;
	for (int t = 1; t <= T; ++ t) {
		cin >> N >> M;
		map <string, int> hash;
		getline(cin, set1[0]);
		for (int i = 0; i < N; ++ i)
			getline(cin, set1[i]);
		for (int i = 0; i < M; ++ i)
			getline(cin, set2[i]);
		sort(set2, set2+M);
		
		for (int i = 0; i < N; ++ i)
		for (int j = 0; j < M; ++ j)
			if (!hash[set1[i]+set2[j]])
				hash[set1[i]+set2[j]] = 1;
			
		cout << "Case " << t << ": " << hash.size() << endl;
	}
    return 0;
}