POJ - 1002 487-3279
来源:互联网 发布:360路由器访客网络 编辑:程序博客网 时间:2024/05/22 11:51
487-3279
Time Limit: 2000MS Memory Limit: 65536KB 64bit IO Format: %I64d & %I64u
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
将形式不同的电话号码转化为同一格式,并把出现次数大于1的电话号码输出(按字典序)。
#include<iostream>#include<map>#include<cstring>#include<string>#include<algorithm>using namespace std;int m[26] = { 2, 2, 2, 3, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 7, 8, 8, 8, 9, 9, 9, 9 }; //用该数组可以较快的实现字母到数字的转换map<int, int>mp; //定义map,前一数据是关键字,后面是出现次数int main(){int n;cin >> n;mp.clear();getchar(); //消耗掉回车键,否则会少输入一组数for (int t = 1; t <= n;t++){char c;int ph = 0;while ((c = getchar()) != '\n') //实现不同格式转为相同格式的方法{if (c == '-') continue; else if (c >= '0'&&c <= '9')ph = ph * 10 + (c - '0');else if (c >= 'A'&& c <= 'Z')ph = ph * 10 + m[c - 'A'];}mp[ph]++; //对同一key的map计数,很常用}bool flat =true;for (map<int, int>::iterator it = mp.begin(); it != mp.end(); it++) //遍历{if (it->second > 1){printf("%03d-%04d %d\n", (it->first) / 10000, (it->first) % 10000, it->second);flat = false;}}if (flat) cout << "No duplicates." << endl; //注意看要求}
0 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
- 编译安装 gcc 4.9并验证使用
- 对man手册的汉化命令
- 深入浅出K-Means算法
- 2015 NJUPT 春训第二场题解报告
- ictclas4j如何在eclipse中进行中文分词
- POJ - 1002 487-3279
- 快速排序
- Moore’s voting algorithm
- mmap内存映射
- c语言stdout,stdin,stderr缓冲问题
- mysql 一些语句的使用
- CSS3学习之路-----CSS3边框
- Jquery正则表达式公式.例子
- HtmlUnit实现人人网登陆