487-3279
Time Limit: 2000MS Memory Limit: 65536KB
Problem 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.
Example 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
Example Output
310-1010 2 487-3279 4 888-4567 3
Hint
这题的一是：将数字字母映射成电话号码，并且删除多余的“-”，只保留或者插入一个‘-’在第四个字符；
并且只输出重复的电话号码和重复次数，没有的话输出No duplicates.
代码：
1 //
2 // main.cpp
3 // SuanFa
4 //
5 // Created by Crazy凡 on 2016/9/27.
6 // Copyright © 2016年 Crazy凡. All rights reserved.
7 //
8
9 #include <iostream>
10 #include <map>
11 #include <string>
12 using namespace std;
13 char changeValue(char charc);
14 int main(int argc, const char * argv[]){
15 int a;
16 cin >> a;
17 map<string, int>countMap;
18 map<string, int>::iterator iter;
19 string inputString;
20 while (a--) {
21 cin >> inputString;
22 string::size_type index = inputString.find(‘-‘);
23 while (index != -1) {
24 inputString.erase(index, 1);
25 index = inputString.find(‘-‘);
26 }
27 for (int i = 0; i < inputString.length(); i++) {
28 inputString[i] = changeValue(inputString[i]);
29 }
30 inputString.insert(3, "-");
31 iter = countMap.find(inputString);
32 if (iter != countMap.end()) {
33 (iter -> second)++;
34 } else {
35 countMap.insert(pair<string, int>(inputString, 1));
36 }
37 }
38 int isOutAnyOne = 0;
39 for (iter = countMap.begin(); iter != countMap.end() ; iter++) {
40 if (iter -> second > 1) {
41 cout << iter -> first << " " << iter -> second << endl;
42 isOutAnyOne = 1;
43 }
44 }
45 if (isOutAnyOne == 0) {
46 cout << "No duplicates." << endl;
47 }
48 return 0;
49 }
50
51 char changeValue(char charc){
52 if (charc >= ‘A‘ && charc < ‘Q‘) {
53 return (charc - ‘A‘) / 3 + ‘2‘;
54 } else if(charc > ‘Q‘ && charc < ‘Z‘){
55 return (charc - ‘Q‘) / 3 + ‘7‘;
56 } else {
57 return charc;
58 }
59 }
Time：272ms Memory：13116kblanguage:g++ Code len:1615B：