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.
This problem contains multiple test cases!
The first line of a multiple input is an integer N, then a blank line followed by N input blocks. Each input block is in the format indicated in the problem description. There is a blank line between input blocks.
The output format consists of N output blocks. There is a blank line between output blocks.
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:
1
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
Solution:
#include <iostream>
#include <string>
#include <set>
using namespace std;
// 声明：本代码仅供学习之用，请不要作为个人的成绩提交。
// http://blog.csdn.net/mskia
// email: [email protected]
int main( void ) {
int cases;
cin >> cases;
for ( int i = 0; i < cases; ++i ) {
int n;
cin >> n;
if ( i != 0 ) {
cout << endl;
}
multiset< string > nums;
set< string > names;
for ( int j = 0; j < n; ++j ) {
string str;
cin >> str;
string newstr = "";
for ( string::iterator p = str.begin( ); p != str.end( ); ++p ) {
if ( *p == '-' ) {
continue;
}
switch ( *p ) {
case 'A': case 'B': case 'C':
newstr += "2";
break;
case 'D': case 'E': case 'F':
newstr += "3";
break;
case 'G': case 'H': case 'I':
newstr += "4";
break;
case 'J': case 'K': case 'L':
newstr += "5";
break;
case 'M': case 'N': case 'O':
newstr += "6";
break;
case 'P': case 'R': case 'S':
newstr += "7";
break;
case 'T': case 'U': case 'V':
newstr += "8";
break;
case 'W': case 'X': case 'Y':
newstr += "9";
break;
default:
newstr += *p;
break;
}
}
newstr.insert( 3 , "-" );
nums.insert( newstr );
names.insert( newstr );
}
int flag = 0;
for ( set< string >::iterator p = names.begin( ); p != names.end( ); ++p ) {
int c = nums.count( *p );
if ( c > 1 ) {
cout << *p << " " << c << endl;
++flag;
}
}
if ( flag == 0 ) {
cout << "No duplicates." << endl;
}
}
system( "pause" );
return 0;
}
本文地址：http://com.8s8s.com/it/it26761.htm