POJ 一 1002 487-3279
来源:互联网 发布:各国域名后缀大全 编辑:程序博客网 时间:2024/06/08 10:00
487-3279
Time Limit: 2000MS Memory Limit: 65536KTotal Submissions: 220227 Accepted: 38384
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
意思大致就是为了方便记忆电话号码,编写一个程序,可以将对应字符转化为对应数字。并以固定格式、号码首位从小到大的顺序输出,并输出重复的次数。若所有号码均不相同,就输出No duplicates!
题目其实不难,刚开始就做出来了。。。因为RE就更改数组大小,这就导致我崩溃的开始!!!
数组b二维开小了一位。。。。!!!!尼玛浪费我N多时间!!!
此代码超时,等以后再改吧。
#include<stdio.h> //排序超时 #include<string.h>char d[11]="0123456789";int main(void){ char a[41]; char change[]="2223334445556667Q77888999Z"; char b[100000][10];//数组二维范围开小了 int len; int n,i,k,j; scanf("%d",&n); int count[100000]={0}; for(i=0;i<n;i++) { scanf("%s",a); len=strlen(a); for(j=0,k=0;j<len;j++) { if(k==3) {b[i][k++]='-';} if(a[j]>='A'&&a[j]<'Z') {b[i][k++]=change[a[j]-'A'];} else if(a[j]=='-') {continue;} else {b[i][k++]=a[j];} } } int flag=0; for(i=0;i<n-1;i++) { if(count[i]==-1) continue; for(j=i+1;j<n;j++) { if(!strcmp(b[i],b[j])) { count[i]++; count[j]=-1; } } } for(i=0;i<10;i++) { for(j=0;j<n;j++) { if(count[j]>0&&b[j][0]==d[i]) { printf("%s %d\n",b[j],count[j]+1); flag++; } } } if(0==flag) printf("No duplicates.\n"); return 0;}
- POJ 一 1002 487-3279
- poj每日一题之1002(487-3279)
- POJ--1002 487-3279
- POJ 1002 487-3279
- POJ 1002 487-3279
- POJ 1002 487-3279
- poj 1002 "487-3279"
- POJ 1002 487-3279
- poj 1002 487-3279
- poj 1002 487-3279
- POJ-1002 487-3279
- poj 1002 487-3279
- POJ 1002 487-3279
- poj 1002 487-3279
- (POJ 1002) 487-3279
- POJ 1002 487-3279
- POJ 1002 487-3279
- [POJ]1002 487-3279
- 安卓与java选择
- db(分贝)的含义
- PHP引用符&的用法详细解析
- php如何配置和测试GD库
- webkit 硬件渲染相关资料收集
- POJ 一 1002 487-3279
- [poj 1039]Pipes[线段相交求交点]
- tomcat6配置jndi连接数据库的方式
- 你应该更新的JAVA知识
- declare-styleable的使用
- 从多选(multiple)的select中得到所选结果
- iOS开发之摇一摇
- 【主板与硬盘不兼容怎么办?】_8.26
- hdu(2614) Beat