POJ 1002
2016-04-17 17:34
274 查看
487-3279
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
来源: <http://poj.org/problem?id=1002>
src1.c
Time Limit: 2000MS | Memory Limit: 65536K | |
Total Submissions: 272169 | Accepted: 48465 |
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
来源: <http://poj.org/problem?id=1002>
src1.c
#include <stdio.h>
#include <string.h>
#include<algorithm>
using namespace std;
#define __INT_INVALID_NUMBER__ 0xff
unsigned char ca_buf[256]={0};
long int fGetNumber(char* p_num)
{
/*
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
*/
long int i32_ret = 0;
int i_n = 0;
for(;p_num[0]!='\0';++p_num)
{
unsigned char ui8_n = ca_buf[p_num[0]];
if(ui8_n == __INT_INVALID_NUMBER__)
{
continue;
}
++i_n;
i32_ret = i32_ret*10+ui8_n;
if(i_n ==7)
{
return i32_ret;
}
}
return i32_ret;
}
void fInitTable()
{
int i,j,k;
memset(ca_buf,__INT_INVALID_NUMBER__,256);
for(i=0;i<=9;++i)
{
ca_buf[i+'0'] = i;
}
for(i='A',j=2,k=0;i<='Y';++i)
{
if(i == 'Q')
{
continue;
}
ca_buf[i] = j;
++k;
if(k == 3)
{
k = 0;
++j;
}
}
}
void fShowDuplicate(long int i32_number,
long int i32_time)
{
printf("%03d-%04d %d\n",i32_number/10000,i32_number%10000,i32_time);
}
int main(void)
{
int n,i;
long int* p_buf;
long int* p_duplicate_buf;
int i_duplicate_number = 0;
p_buf = (long int*)calloc(sizeof(long int),10000000);
p_duplicate_buf = (long int*)calloc(sizeof(long int),50000);
fInitTable();
scanf("%d",&n);
while(n-->0)
{
char ca_buf[300];
long int i32_num;
scanf("%s",ca_buf);
i32_num = fGetNumber(ca_buf);
++p_buf[i32_num];
if(p_buf[i32_num] == 2)
{
p_duplicate_buf[i_duplicate_number++] = i32_num;
}
}
sort(p_duplicate_buf,p_duplicate_buf+i_duplicate_number);
for(i = 0;i < i_duplicate_number;++i)
{
fShowDuplicate(p_duplicate_buf[i],p_buf[p_duplicate_buf[i]]);
}
if(i_duplicate_number == 0 )
{
printf("No duplicates.");
}
free(p_buf);
return 0;
}
相关文章推荐
- VGScene(firemonkey前身)布局设置
- 【简易版】IOS仿periscope自制狂赞飘桃心
- 【Leetcode146】LRU Cache
- 20145309《Java程序设计》第七周学习总结
- 消息队列(msg)
- ListView
- 文章标题 : 介绍 GNU Octave scrip
- windows server 2008 w3svc服务无法启动,错误 1068:依赖服务或组件无法启动
- SDWebImage 中简单的清除缓存
- 机器学习常见算法
- go与c互相调用
- 第五篇学习笔记
- the repository is out of date
- Slick 图片左右滑动幻灯片效果
- QPSK Transmitter and Receiver
- 事务的四大特性
- WPF的消息机制
- 夺命雷公狗---Thinkphp----7之栏目配合Model的增删改查
- PHP文件上传类
- android插件开发——加载插件