487-3279
487-3279 |
Businesses like to have memorable telephone numbers. One way to make a telephone number memorableis to have it spell a memorable word or phrase. For example, you can call the University of Waterloo bydialing the memorable TUT-GLOP. Sometimes only part of the number is used to spell a word. Whenyou get back to your hotel tonight you can order a pizza from Gino's by dialing 310-GINO. Anotherway to make a telephone number memorable is to group the digits in a memorable way. You couldorder 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 andfourth 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 thestandard 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 thequality control process you want to check that no two (or more) businesses in the directory have the same telephone number.
Input
The first line of the input contains the number of datasets in the input. A blank line follows. The first line of each dataset specifies the number of telephone numbersin the directory (up to 100,000) as a positive integer alone on the line. The remaining lines list thetelephone numbers in the directory, with each number alone on a line. Each telephone number consistsof a string composed of decimal digits, uppercase letters (excluding Q and Z) and hyphens. Exactlyseven of the characters in the string will be digits or letters. There's a blank line between datasets.Output
Generate a line of output for each telephone number that appears more than once in any form. Theline should give the telephone number in standard form, followed by a space, followed by the numberof times the telephone number appears in the directory. Arrange the output lines by telephone numberin ascending lexicographical order. If there are no duplicates in the input print the line:No duplicates.
Print a blank line between datasets.
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
Miguel A. Revilla
2000-02-09
这题的大意是为了方便记忆电话,有时将电话中的数字转换成字母,各字母都对应着一个数字,现给出n串电话,要求将这些电话还原成本身后是否有重复的,将重复的电话及重复此处输出,若都不相同则输出“No duplicates”。因为整个电话的长度都为7,所以直接建立了一个10,000,000的数组记录该电话的出现次数。对于各个电话,先是以字符串形式读入,然后将其字母按照一一对应转换为数字,然后将这些字符串中的数字转换为整形,将各个电话次数对应的数组每次+1,最后按照格式输出。
#include <iostream>
#include <algorithm>
#include <cstring>
#include <cstdio>
#include <cctype>
#include <cmath>
using namespace std;
const int N = 10000000;
const int L = 100;
const int l[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};
int times[N];
int main() {
int Case; //
cin >> Case; //
cout << endl; //
while (Case--) {
memset(times,0,sizeof(times));
int Test;
int tmp;
char str[L];
bool cnt = false;
cin >> Test;
getchar();
while (Test--) {
memset(str,0,sizeof(str));
tmp = 0;
gets(str);
for (int i = 0,j = 6; i < L && j >= 0; i++) {
if (isupper(str[i])) {
tmp += l[str[i]-'A'] * (int)pow(10,j);
j--;
}
else if (isdigit(str[i])) {
tmp += (str[i] - '0') * (int)pow(10,j);
j--;
}
}
times[tmp]++;
if (times[tmp] > 1)
cnt = true;
}
if (cnt)
for (int i = 0; i < N; i++)
if (times[i] > 1)
printf("%03d-%04d %d\n",i/10000,i%10000,times[i]);
else
cout << "No duplicates." << endl;
} //
return 0;
}