uva 755 - 487--3279

  487-3279 

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 first line of the input contains the number of datasets in the input. A blank line follows. The first line of each dataset 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. There's a blank line between datasets.

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.

Print a blank line between datasets.

Sample Input 

1124873279ITS-EASY888-45673-10-10-10888-GLOPTUT-GLOP967-11-11310-GINOF101010888-1200-4-8-7-3-2-7-9-487-3279

Sample Output 

310-1010 2487-3279 4888-4567 3

题目要求输出有重复的电话号码，

先按要求将字符串转换成号码，开始的时候想偷懒用桶排序开个10000000的数组然后一个电话号码看成七位数进行计数然后输出，结果runtime error╮(╯▽╰)╭。

然后只能按要求存储最多可能有10^5的号码进行快排，然后输出，最后一个数据不用换行wrong了几次。

还有输出一定是七位数所以不足的要补够0，学习了下别人的写法直接在printf里加0即可很方便。

学习了用stl的qsort，因为用了自己写的快排就超时不知为什么，用了很多年的快排模板，超时了，用库函数qsort就没超时~~~~(>_<)~~~~

#include <stdio.h>
#include <string.h>
#include <stdlib.h>
int comp(const void *a,const void *b)
{return *(int*)a-*(int*)b;}
void main()
{char s[300];
 int alpha[27]={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},i,j,n,l,number,sum,t;
 int a[100001];
 scanf("%d",&t);
 while (t--)
 {
 scanf("%d\n",&n);
 for (j=0;j<n;j++)
 {scanf("%s",&s);
  number=0;
  l=strlen(s);
  for (i=0;i<l;i++)
  {if ((s[i]>='A')&&(s[i]<='Z')) number=number*10+alpha[s[i]-'A'];
   if ((s[i]>='0')&&(s[i]<='9')) number=number*10+s[i]-'0';
  }
  a[j]=number;
 }
 qsort(a,n,sizeof(int),comp);
 i=0;  sum=0;
 while (i<n-1)
 {j=i;
  while ((j<n-1)&&(a[j]==a[j+1])) j++;
  if (j>i) {printf("%03d-%04d %d\n",a[i]/10000,a[i]%10000,j-i+1);++sum;}
  i=j+1;
 }
 if (sum==0) printf("No duplicates.\n");
 if (t) printf("\n");
 }
}