poj 1002 map实现hash
来源:互联网 发布:mac安装 chrome 编辑:程序博客网 时间:2024/05/18 02:05
487-3279
Time Limit: 2000MS Memory Limit: 65536KTotal Submissions:299255 Accepted: 53552
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
题目描述: 给你一串字符 比给出每个字符对应的表 让你转换成对应的电话号码 并输出出现次数超过一次的电话号码和出现的次数
hash思想 转换成唯一对应的数字 刚开始用数组开了一个十位的数组 然后空间超了 开九位就会数组越界
然后就去搜了一下 发现可以用map写 stl真的是很神奇的东西
#include <iostream>#include <cstdio>#include <cstring>#include <set>#include <map>using namespace std;int num[] ={2, 2, 2,3, 3, 3,4, 4, 4,5, 5, 5,6, 6, 6,7, 0, 7, 7,8, 8, 8,9, 9, 9};map<int, int> s;//map定义char buf[128];int main(){int t;scanf("%d", &t);bool flag = false;for(int i = 0; i < t; i++){scanf("%s", &buf);int c = 0;for(int j = 0; buf[j]; j++){if(isdigit(buf[j]))c = c * 10 + buf[j] - '0';else if(isalpha(buf[j]))c = c * 10 + num[ buf[j] - 'A' ];}s[c]++;}map<int, int>::iterator it;//声明map的迭代器for( it = s.begin(); it != s.end(); it++)if(it->second > 1){flag = true;printf("%03d-%04d %d\n", it->first / 10000, it->first % 10000, it->second);}if(!flag)puts("No duplicates.");return 0;}
阅读全文
0 0
- poj 1002 map实现hash
- poj 2503 【hash】【map】
- POJ 2503 Babelfish(hash + map)
- 一个极好的hash map实现-字符串hash
- hash map
- Hash Map / Hash Set
- poj 3320 Jessica's Reading Problem(尺取法+map/hash)
- poj 2945 Find the Clones (map+string,hash思维)
- POJ 2503 Babelfish(map或hash或排序二分)
- poj 1002 stl map
- 一个高效的hash str map 的实现
- hash map的使用
- c++中的hash map
- poj1840 map + hash
- C++ hash map
- hdu 1004 hash map
- C++中的hash Map
- hash-map详解
- 《华夏群英挂机版》隐私政策
- [JLOI2014]松鼠的新家 倍增LCA+树上差分
- DirectShow简介
- 维谛技术(Vertiv)开启网络能源新时代
- 转型密码@Hitachi Vantara到底是怎样一家公司?
- poj 1002 map实现hash
- Java学习笔记(6): 时间与日期
- srs-bench测试环境
- 【React dva】 编码笔记备忘
- 仿百度搜索实时监听输入框值的oninput与onpropertychange方法
- Spring Boot使用JDBC Template访问数据
- 五个你可能不了解的killall选项(转载)
- 番外1-5——《地与光》
- 【安全牛学习笔记】COWPATTY 破解密码