poj1002
来源:互联网 发布:vmware10 for mac下载 编辑:程序博客网 时间:2024/06/16 00:26
487-3279
Time Limit: 2000MS Memory Limit: 65536KTotal Submissions: 245711 Accepted: 43570
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>int num[1000][10000];int main(){int n;int sum = 0;int high,low;int i,j,k,len;int t1,t2,tmp;char c[1000];int flag = 0;for(i = 0;i < 1000;i ++)for(j = 0;j < 10000;j ++)num[i][j] = 0;scanf("%d",&n);getchar();while(n > 0){i = 0;high = 0;low = 0;scanf("%s",c);len = strlen(c);for(k = 0;k < len;k ++){if(c[k] >= '0' && c[k] <= '9'){if(i < 3)high = high * 10 + c[k] - '0';elselow = low * 10 + c[k] - '0';i ++;}else if(c[k] >= 'A' && c[k] <= 'P'){if(i < 3)high = high * 10 + 2 + (c[k] - 'A') / 3;elselow = low * 10 + 2 + (c[k] - 'A') / 3;i ++;}else if(c[k] >= 'R' && c[k] <= 'Y'){if(i < 3)high = high * 10 + 2 + (c[k] - 'A' - 1) / 3;elselow = low * 10 + 2 + (c[k] - 'A' - 1) / 3;i ++;}}num[high][low] ++;n --;}for(i = 0;i < 1000;i ++)for(j = 0;j < 10000;j ++){if(num[i][j] > 1){printf("%03d-%04d %d\n",i,j,num[i][j]);flag = 1;}}if(flag == 0)printf("No duplicates.\n");return 0;}
0 0
- POJ1002
- POJ1002
- poj1002
- poj1002
- poj1002
- poj1002
- poj1002
- POJ1002
- poj1002
- POJ1002
- POJ1002
- POJ1002
- poj1002
- POJ1002
- POJ1002
- poj1002
- poj1002
- POJ1002
- Cocos2d-x中__Dictionary容器的使用详解
- error C2011: “Shape”:“class”类型重定义 问题的解决
- memberCache java客户端的使用
- Android自定义视图(一):带下划线的TextView
- HDU——1251 统计难题
- poj1002
- zoj 3823 Excavator Contest(构造)
- 第七周编程——员工周工资计算
- 某大神网站发现2048一枚
- MFC 获取当前路径
- vc创建自定义按钮
- MZ Training 2014 #8 F题
- grub for qemu
- 2014-10-13 学习日志