北大 ACM 1002 487-3279
来源:互联网 发布:java 教程哪个好 编辑:程序博客网 时间:2024/05/01 06:55
487-3279
Time Limit: 2000MS Memory Limit: 65536KTotal Submissions: 220050 Accepted: 38357
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 <iostream>#include <string>#include <map>using std::cin;using std::cout;using std::endl;using std::string;using std::map;using std::pair;int main(){int count_num = 0; map<string, int> result;cin >> count_num;string *str = new string[count_num];for(int i=0; i < count_num; i++){cin >> str[i];}string temp("");string s("");int x = 0; for(int i=0; i<count_num; i++){for(unsigned int j=0; j < str[i].length(); j++){s = "";if(x == 3){temp.append("-");x++;}char t = str[i][j];if(t >= 'A' && t <= 'Z'){if(t == 'A' || t == 'B' || t == 'C'){temp.append("2");}else if(t == 'D' || t == 'E' || t == 'F'){temp.append("3");}else if(t == 'G' || t == 'H' || t == 'I'){temp.append("4");}else if(t == 'J' || t == 'K' || t == 'L'){temp.append("5");}else if(t == 'M' || t == 'N' || t == 'O'){temp.append("6");}else if(t == 'P' || t == 'R' || t == 'S'){temp.append("7");}else if(t == 'T' || t == 'U' || t == 'V'){temp.append("8");}else if(t == 'W' || t == 'X' || t == 'Y'){temp.append("9");}}elseif(t >= '0' && t <= '9'){s.insert( s.begin(), t );temp.append(s); }else {continue;}x++;}pair<map<string, int >::iterator, bool> ret = result.insert(make_pair(temp, 1));if(!ret.second)++ret.first->second;x = 0;temp = "";}map<string, int>::const_iterator map_it = result.begin();bool flag = true;while(map_it != result.end()){if(map_it->second > 1){cout << map_it->first << " " << map_it->second << endl;flag = false;}++map_it;}if(flag)cout << "No duplicates. " << endl;//int f;//cin >> f;return 0;}
今天早上连过2题......有点小得色
- 北大 ACM 1002 487-3279
- ACM-北大1002 487-3279
- 北大ACM poj1002 487-3279
- 北大 ACM 1002 题 487-3279 的 菜鸟JAVA解
- 北大ACM试题1002
- 北大ACM
- 北大ACM-题型分类
- 北大ACM题型分类
- 北大ACM做题小软件
- 北大acm 题型分类
- 北大ACM分类初期
- 北大ACM题分类
- 北大ACM题型分类
- 北大ACM题型分类
- 北大ACM-题型分类
- 北大 ACM 1423
- 北大ACM习题参考答案
- 北大 ACM 1111题
- SimpleDateFormat 格式化参数说明
- MYSQL 索引类型及用法
- 规则引擎配置器简单理解
- 简单的计算器程序(摘自java核心技术.卷I)
- 总结--敲学生信息管理系统的心得
- 北大 ACM 1002 487-3279
- cocos2d-x启动次序
- ios编程--AVCapture编程理解
- Qt5 基于TCP传输的发送/接收文件服务器(支持多客户端)
- MySQL binlog_format (Mixed,Statement,Row)[转]
- String cannot be resolved to a type
- ajax与jQuery的异步提交,他在什么情况下会走error
- C语言中动态分配数组指针的释放问题
- C++ 函数的重载,覆盖及隐藏解析