POJ 1002 487-3279
2016-05-04 21:44
405 查看
A - 487-3279
Time Limit:2000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64u
Submit Status Practice POJ 1002
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
Sample Output
Time Limit:2000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64u
Submit Status Practice POJ 1002
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
//hash直接过 #include<cstdio> #include<cstring> int hash[10010000]={0}; int zhuanzhi(int n) { int sum=1,i; for(i=1;i<n;i++) sum*=10; return sum; } int zhuanhuan(char f[]) { int sum=0,i; int t=strlen(f); for(i=t-1;i>=0;i--) { sum=sum+(f[i]-'0')*zhuanzhi(t-i); } return sum; } int main() { int zong,i,j; scanf("%d",&zong); while(zong--) { char f[100],g[100]; scanf("%s",f); int s=-1; for(i=0;f[i]!='\0';i++) { switch(f[i]) { case '0': g[++s]='0'; break; case '1': g[++s]='1'; break; case 'A':case 'B':case 'C':case '2': g[++s]='2'; break; case 'D':case 'E':case 'F':case '3': g[++s]='3'; break; case 'G':case 'H':case 'I':case '4': g[++s]='4'; break; case 'J':case 'K':case 'L':case '5': g[++s]='5'; break; case 'M':case 'N':case 'O':case '6': g[++s]='6'; break; case 'P':case 'R':case 'S':case '7': g[++s]='7'; break; case 'T':case 'U':case 'V':case '8': g[++s]='8'; break; case 'W':case 'X':case 'Y':case '9': g[++s]='9'; break; } } g[++s]='\0'; hash[zhuanhuan(g)]++; } int count=0; for(i=0;i<10000000;i++) if(hash[i]>1) { printf("%03d-%04d %d\n",i/10000,i%10000,hash[i]); count++; } if(count==0)printf("No duplicates.\n"); return 0; }
相关文章推荐
- H5页开发规范/通用规范
- ACL(一)
- java字符串相关
- guava 事件总线
- C++ 快速幂取模+大数相乘取模
- LeetCode Word Break
- 在Windows下编译OpenSSL(VS2005和VC6)
- hdu 2555
- Android开发设置EditText不获得焦点
- Leetcode - House Robber
- 访问数据方法
- 图片热点和网页内嵌随笔
- 成就故事
- C++11 之 nullptr
- Java对已有的文件续写操作FileWriter
- 【BZOJ3781】小B的询问【莫队算法】
- POJ 1182 食物链
- 简单实例讲解linux的module模块编译步骤
- Python的学习笔记(一)(基础)
- 浅析ICMP洪水攻击