poj1002
来源:互联网 发布:mac如何隐藏桌面文件 编辑:程序博客网 时间:2024/05/21 19:26
487-3279
Time Limit: 2000MS Memory Limit: 65536KTotal Submissions: 216806 Accepted: 37738
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.
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.
No duplicates.
Sample Input
124873279ITS-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
#include<stdio.h>#include<string.h>#include<stdlib.h>char a[100010][44],c[44],d[44];int cmp_string(const void * _a,const void *_b)//比较函数{ char *a=(char *)_a; char *b=(char *)_b; return strcmp(a,b);}main(){ int t=1,temp=0; long i,j,z,n; //freopen("D:\\b.txt","r",stdin); scanf("%ld\n",&n); for(i=0;i<n;i++)//转化成标准形式 { gets(d); for(j=0,z=0;d[z]!='\0';z++) { if(d[z]!='-') { if(j==3) a[i][j++]='-'; if('0'<=d[z]&&d[z]<='9') a[i][j++]=d[z]; else { if(d[z]=='A'||d[z]=='B'||d[z]=='C') a[i][j++]='2'; else if(d[z]=='D'||d[z]=='E'||d[z]=='F') a[i][j++]='3'; else if(d[z]=='G'||d[z]=='H'||d[z]=='I') a[i][j++]='4'; else if(d[z]=='J'||d[z]=='K'||d[z]=='L') a[i][j++]='5'; else if(d[z]=='M'||d[z]=='N'||d[z]=='O') a[i][j++]='6'; else if(d[z]=='P'||d[z]=='R'||d[z]=='S') a[i][j++]='7'; else if(d[z]=='T'||d[z]=='U'||d[z]=='V') a[i][j++]='8'; else if(d[z]=='W'||d[z]=='X'||d[z]=='Y') a[i][j++]='9'; } } } } qsort(a,n,sizeof(a[0]),cmp_string);//按字典排序字符串 strcpy(c,a[0]); for(i=1;i<n;i++)//统计字符串若有相同即输出 { while(strcmp(c,a[i])==0) { i++;t++; } if(t>1) { printf("%s %d\n",c,t); temp=1; } strcpy(c,a[i]);t=1; } if(temp!=1)//若没有相同的就输出一下内容 printf("No duplicates. \n"); return 0;}
- POJ1002
- POJ1002
- poj1002
- poj1002
- poj1002
- poj1002
- poj1002
- POJ1002
- poj1002
- POJ1002
- POJ1002
- POJ1002
- poj1002
- POJ1002
- POJ1002
- poj1002
- poj1002
- POJ1002
- Game Design: The king of Open War
- 自己封装的多媒体定时器类和时间核心对象线程类
- 不知道这串代码什么意思
- mybatis级联查询的新写法
- hdu 1869
- poj1002
- Linux SSH 远程乱码问题 解决方法
- activemq Unrecognized Windows Sockets error: 0: JVM_Bind无法启动,端口被占用
- Java中File的简单使用
- 游戏沉迷原理浅析
- java中的数学计算函数
- leetcode:Subsets II
- coco2dx + lua 新建工程 error LNK2019: 无法解析的外部符号
- javascript实现俄罗斯方块