poj 1002

#include <iostream>
#include <string>
#include <map>
using namespace std;
char telephoneMap[] ={'2', '2', '2', '3', '3', '3', '4', '4', '4', '5', '5', '5', '6', '6', '6', '7', '0', '7', '7', '8', '8', '8', '9', '9', '9', '0'};
int main()
{
	int n;
	map<string, int> m_telPair;
	scanf("%d", &n);
	string tmp;
	while((--n) >= 0)
	{
		cin >> tmp;
		string value;
		for(int i = 0; i < tmp.length(); i++)
		{
			if(tmp[i] != '-')
			{
				if(tmp[i] <= '9' && tmp[i] >= '0')
				{
					value.append(1, tmp[i]);
				}
				else
				{
					value.append(1, telephoneMap[tmp[i] - 'A']);
				}
			}
		}
		m_telPair[value] += 1;
	}

	map<string, int>::iterator itor;
	bool exist = false;
	for(itor = m_telPair.begin(); itor != m_telPair.end(); itor++)
	{
		if(itor->second > 1)
		{
			exist = true;
			cout << (itor->first).substr(0, 3) << "-" << (itor->first).substr(3, 7) << " " << itor->second << endl;
		}
	}
	if(!exist)
	{
		cout << "No duplicates." << endl;
	}
}