UVA - 755 487--3279

题目大意：输入的每行都是一个电话号码，字母可以化为数字，多余的 - 可以删去，输出出现 > 1 次的号码以及出现的次数。

解题思路：读入，化为电话，排序，循环与后一个号码比较，出现多于一次的就输出。TLE 了好久，两个 for 循环对比效率太低qwq

#include<iostream> 
#include<cstdio>
#include<string.h>
#include<stdlib.h>
#include<cmath>
using namespace std;
char str[500000][50];
char ph[500000][50];
char change[]="2223334445556667 77888999";
int cmp(const void*a,const void*b) {
    return strcmp((char *)a,(char*)b);
}
int main() {
    int T;
    scanf("%d", &T);
    while(T--) {
        memset (ph, '\0', sizeof(ph));
        int N;
        scanf("%d\n", &N);
        for (int i = 0; i < N; i++)
            gets(str[i]);
        for (int i = 0; i < N; i++) {
            int k = 0;
            for (int j = 0; str[i][j] != '\0'; j++) {
                if (str[i][j] >= '0' && str[i][j] <= '9')
                    ph[i][k++] = str[i][j];
                if (str[i][j] >= 'A' && str[i][j] <= 'Z')
                    ph[i][k++] = change[str[i][j] - 'A'];
            }
        }
        qsort(ph, N, sizeof(ph[0]), cmp);
        int sum = 1, tag = 0;
        for (int i = 0; i < N; i++)
            if( strcmp(ph[i], ph[i+1]) == 0)
                    sum++;
            else if (sum > 1) {
                tag = 1;
                for (int j = 0; j < 7; j++) {
                    if (j == 3) printf("-");
                    printf("%c", ph[i][j]);
                }
                printf(" %d\n", sum);
                sum = 1;
            }
        if (!tag) printf("No duplicates.\n");
        if(T) printf("\n"); 
    }
return 0; 
}