487-3279(poj-1002map容器)

Description
Businesses like to have memorable telephone numbers. One way to make a telephone number memorable is to have it spell a memorable word or phrase. For example, you can call the University of Waterloo by dialing the memorable TUT-GLOP. Sometimes only part of the number is used to spell a word. When you get back to your hotel tonight you can order a pizza from Gino’s by dialing 310-GINO. Another way to make a telephone number memorable is to group the digits in a memorable way. You could order your pizza from Pizza Hut by calling their ``three tens’’ number 3-10-10-10.

The standard form of a telephone number is seven decimal digits with a hyphen between the third and fourth digits (e.g. 888-1200). The keypad of a phone supplies the mapping of letters to numbers, as follows:

A, B, and C map to 2
D, E, and F map to 3
G, H, and I map to 4
J, K, and L map to 5
M, N, and O map to 6
P, R, and S map to 7
T, U, and V map to 8
W, X, and Y map to 9

There is no mapping for Q or Z. Hyphens are not dialed, and can be added and removed as necessary. The standard form of TUT-GLOP is 888-4567, the standard form of 310-GINO is 310-4466, and the standard form of 3-10-10-10 is 310-1010.

Two telephone numbers are equivalent if they have the same standard form. (They dial the same number.)

Your company is compiling a directory of telephone numbers from local businesses. As part of the quality control process you want to check that no two (or more) businesses in the directory have the same telephone number.

Input
The input will consist of one case. The first line of the input specifies the number of telephone numbers in the directory (up to 100,000) as a positive integer alone on the line. The remaining lines list the telephone numbers in the directory, with each number alone on a line. Each telephone number consists of a string composed of decimal digits, uppercase letters (excluding Q and Z) and hyphens. Exactly seven of the characters in the string will be digits or letters.

Output
Generate a line of output for each telephone number that appears more than once in any form. The line should give the telephone number in standard form, followed by a space, followed by the number of times the telephone number appears in the directory. Arrange the output lines by telephone number in ascending lexicographical order. If there are no duplicates in the input print the line:

No duplicates.

Sample Input

12
4873279
ITS-EASY
888-4567
3-10-10-10
888-GLOP
TUT-GLOP
967-11-11
310-GINO
F101010
888-1200
-4-8-7-3-2-7-9-
487-3279

Sample Output

310-1010 2
487-3279 4
888-4567 3
题意描述：这题的意思就是给你一个包含数字或字母的电话号码，让你判断给出的所有电话号码中是否有重复的号码，如果有就输出这个号码并输出出现的次数，没有的话就输出没有重复的。
AC代码如下：

#include<stdio.h>
#include<map>
#include<string>
#include<string.h>
#include<algorithm>
#include<iostream>
using namespace std;
int main()
{
	map<char,char> m1;//初始化每个字符对应的数字
	m1['A']=m1['B']=m1['C']='2';
	m1['D']=m1['E']=m1['F']='3';
	m1['G']=m1['H']=m1['I']='4';
	m1['J']=m1['K']=m1['L']='5';
	m1['M']=m1['N']=m1['O']='6';
	m1['P']=m1['R']=m1['S']='7';
	m1['T']=m1['U']=m1['V']='8';
	m1['W']=m1['X']=m1['Y']='9';
	int n,i,j,t;
	char s[200],s1[200];
	while(scanf("%d",&n)!=EOF)
	{
		map<string,int> m;
		while(n--)
		{
			t=0;
			scanf("%s",s);//先将每个所给出的串进行转换
			for(i=0;s[i]!='\0';i++)
			{
				if(s[i]=='-')
					continue;
				if(s[i]>='A'&&s[i]<='Z')
				{
					s1[t++]=m1[s[i]];
					if(t-1==2)
						s1[t++]='-';
				}	
				if(s[i]>='0'&&s[i]<='9')
				{
					s1[t++]=s[i];
					if(t-1==2)
						s1[t++]='-';
				}		
			}
			m[s1]++;//每个串对应的次数出现一次加一次	
		}
		int flag=0;
		map<string,int>::iterator it;
		for(it=m.begin();it!=m.end();it++)
		{
			if((*it).second>1)
			{
				flag=1;
				cout<<(*it).first<<" "<<(*it).second<<endl;
			}
		}
		if(flag==0)
		printf("No duplicates.\n");	
	}
	return 0;
	
}