POJ 1002

487-3279

Time Limit: 2000MS		Memory Limit: 65536K
Total Submissions: 279649		Accepted: 49936

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

Source

East Central North America 1999

题意分析,思路过程均在代码的注释内

<span style="font-family:Courier New;font-size:18px;">#include <stdio.h>
#include <stdlib.h>
#include <string.h>

char map[26] = {'2', '2', '2', '3', '3', '3', '4', '4', '4',
                '5', '5', '5', '6', '6', '6', '7', '7', '7',
                '7', '8', '8', '8', '9', '9', '9', '9'};

int n;                  ///  测试用例个数
char number[80];        ///  读取输入的电话号码个数
char phone[100000][9];  ///  存储结果:前面存储字符数组,后面存储个数

int main(void)
{
    int loop;                   ///  loop用来遍历电话号码
    int phone_i=0, phone_j=0;   ///  phone_i:n次操作 phone_j:记录某个电话号码出现次数
    int tag = 0;                ///  标记前后电话号码是否相同
    int count = 1;              ///  记录某个电话号码出现的次数

    scanf("%d", &n);

    for(phone_i=0; phone_i<n; phone_i++){
        scanf("%s", number);

        ///  遍历电话号码字符数组
        for(loop=0; number[loop]!='\0'; loop++){

            ///  将第四个位置加上'-',字符串整体向后移动一位
            if(phone_j == 3){
                phone[phone_i][phone_j] = '-';
                phone_j++;
            }

        ///  数字赋值给字符数组
            if(number[loop]>='0' && number[loop]<='9'){
                phone[phone_i][phone_j] = number[loop];
            }
        ///  字母转换为数字
            else if(number[loop]>='A' && number[loop]<='Z'){
                phone[phone_i][phone_j] = map[number[loop]-'A'];
            }

        ///  如果输入有'-',则跳过
            else if(number[loop] == '-'){
                continue;
            }

        /// 电话号码个数+1
            phone_j++;
        }

        ///  初始化
        phone_j = 0;
    }

    ///  排序phone数组
    qsort(phone, n, 9, strcmp);

    ///  遍历电话号码字符数组
    /**  电话号码排序结束后
    **  相邻的电话进行比较
    **  如果相邻的两个电话号码相等,则count++
    **  若不等,则说明后面没有相同的电话了,输出即可
    **  其中tag用来标记是否前后两个电话号码相同
    **/
    for(loop=1; loop<n; loop++){
        if(strcmp(phone[loop], phone[loop-1]) == 0){
            tag = 1;
            count++;
        }
        else{
            if(count > 1){
                printf("%s %d\n", phone[loop-1], count);
            }
            count = 1;      ///  输出后,count要初始化
        }
    }

    ///  如果在最后count>1,则说明最后两个电话号码相同,输出即可
    if(count > 1){
        printf("%s %d\n", phone[loop-1], count);
    }
    ///  如果tag==0,说明最后两个电话号码不同,输出No duplicates
    if(!tag)
        printf("No duplicates.\n");
    return 0;
}</span><span style="font-family:Times New Roman, Times, serif;font-size:14px;">
</span>