487-3279----模拟

487-3279

Time Limit: 2000 ms Memory Limit: 65536 KiB

Submit Statistic Discuss

Problem 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

Hint

Source

题目链接：https://acm.sdut.edu.cn/onlinejudge2/index.php/Home/Index/problemdetail/pid/1001.html

算是一个简单的模拟题吧，题目的意思是说找出重复的电话号码并输出重复的次数，重复电话号码规则如下：

A、B、C 替换成数字2

D、E、F 替换成数字3

J、K、L 替换成数字4

M、N、O 替换成数字6

P、R、S 替换成数字7

T、U、V 替换成数字8

W、X、Y 替换成数字9

另外数字就是数字，连字符与'Q'字符和'Z'字符不加入计算

每行保证输入大写字母、数字七个

输出格一个替换后的电话号码，并在第三个和第四个字符中间加上一个连字符，后跟一个空格和重复次数。

我的思路很简单，转换成整数类型直接排序就可以了，但需要注意一点，以零开头的电话号码转换成整数后，在输出时需要在开头以'0'字符补齐，忘了这一点，wa了两次。

因午休时在公司的上网机进行编辑，无C++编译器，所以使用Java代码来敲，思路是一样的。

代码：

import java.util.Arrays;
import java.util.Scanner;


public class Main {
	public static void main(String[] args){
		Scanner sc= new Scanner(System.in);
		Integer ans[] =new Integer [100005];
		while(sc.hasNext()){
			String s;
			String nn=sc.next();
			int n=Integer.parseInt(nn);
			for(int i=0;i<n;i++){
				int k=0;
				s=sc.next();
				int len=s.length();
				for(int j=0;j<len;j++){
					char c=s.charAt(j);
					if(c=='A'||c=='B'||c=='C'){
						k=k*10+2;
					}
					else if(c=='D'||c=='E'||c=='F'){
						k=k*10+3;
					}
					else if(c=='G'||c=='H'||c=='I'){
						k=k*10+4;
					}
					else if(c=='J'||c=='K'||c=='L'){
						k=k*10+5;
					}
					else if(c=='M'||c=='N'||c=='O'){
						k=k*10+6;
					}
					else if(c=='P'||c=='R'||c=='S'){
						k=k*10+7;
					}
					else if(c=='T'||c=='U'||c=='V'){
						k=k*10+8;
					}
					else if(c=='W'||c=='X'||c=='Y'){
						k=k*10+9;
					}
					else if(c>='0'&&c<='9'){
						int kk=(int)(c-'0');
						k=k*10+kk;
					}
				}
				ans[i]=k;
			}
			Arrays.sort(ans,0,n);
			int k=1;
			ans[n]=-1;
			boolean flag=false;
			for(int i=0;i<n;i++){
				String str=ans[i].toString();
//				System.err.println(ans[i]);
				if(ans[i].equals(ans[i+1])){
					k++;
				}
				if(!(ans[i].equals(ans[i+1]))&&k!=1){
					flag=true;
					int len=str.length();
					str="";
					for(int j=0;j<7-len;j++){
						str=str+"0";
					}//记得补零
					str=str+ans[i].toString();
//					System.err.println(str);
					String s1=str.substring(0,3);
					String s2=str.substring(3,7);
					System.out.println(s1+"-"+s2+" "+k);
					k=1;
				}
			}
			if(!flag){
				System.out.println("No duplicates.");
			}
		}
	}
}