487-3279另一种解法

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cctype>
#include <vector>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <cmath>
#include <algorithm>
#include <string>
using namespace std;
int main()
{
char a[26]={'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 num;
string temp;
map<string,int> mymap;
cin>>num; 
for(int i=0;i<num;i++)
{
	cin>>temp;
	string temp1="";
	for(int j=0;j<temp.length();j++)
	{
		if(temp[j]=='-')
		continue;
		else
		{
			if(temp[j]>='0'&&temp[j]<='9')
			temp1+=temp[j];
			else
			temp1+=a[temp[j]-'A'];
		}
	}
	temp1.insert(3,1,'-');
	mymap[temp1]++;
 } 
 map<string,int>::iterator iter;
 int flag=0;
 for(iter=mymap.begin();iter!=mymap.end();iter++)
 {
 	if(iter->second>1)
 	{
 		flag=1;
 		cout<<iter->first<<" "<<iter->second<<endl;
	 }
 }
 if(flag==0)
 cout<<"No duplicates."<<endl;
 return 0;
}