Time Limit:2000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64u
Description
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
Output
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
//hash直接过
#include<cstdio>
#include<cstring>
int hash[]={};
int zhuanzhi(int n)
{
int sum=,i;
for(i=;i<n;i++)
sum*=;
return sum;
}
int zhuanhuan(char f[])
{
int sum=,i;
int t=strlen(f);
for(i=t-;i>=;i--)
{
sum=sum+(f[i]-'')*zhuanzhi(t-i);
}
return sum;
}
int main()
{
int zong,i,j;
scanf("%d",&zong);
while(zong--)
{
char f[],g[];
scanf("%s",f);
int s=-;
for(i=;f[i]!='\0';i++)
{
switch(f[i])
{
case '':
g[++s]='';
break;
case '':
g[++s]='';
break;
case 'A':case 'B':case 'C':case '':
g[++s]='';
break;
case 'D':case 'E':case 'F':case '':
g[++s]='';
break;
case 'G':case 'H':case 'I':case '':
g[++s]='';
break;
case 'J':case 'K':case 'L':case '':
g[++s]='';
break;
case 'M':case 'N':case 'O':case '':
g[++s]='';
break;
case 'P':case 'R':case 'S':case '':
g[++s]='';
break;
case 'T':case 'U':case 'V':case '':
g[++s]='';
break;
case 'W':case 'X':case 'Y':case '':
g[++s]='';
break;
}
}
g[++s]='\0';
hash[zhuanhuan(g)]++;
}
int count=;
for(i=;i<;i++)
if(hash[i]>)
{
printf("%03d-%04d %d\n",i/,i%,hash[i]);
count++;
}
if(count==)printf("No duplicates.\n");
return ;
}