POJ 1002 487-3279
2014-08-13 01:50
330 查看
487-3279
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.
Sample Input
Sample Output
Source
East Central North America 1999
Time Limit: 2000MS | Memory Limit: 65536K | |
Total Submissions: 242045 | Accepted: 42924 |
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.
Sample 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
Sample Output
310-1010 2 487-3279 4 888-4567 3
Source
East Central North America 1999
#include <iostream> #include <map> #include <cstring> #include <string> #include <cstdio> //#include <fstream> using namespace std; char f(char c){ char b[10][4]={{'0','0','0','0'},{'1','1','1','1'},{'A','B','C','2'},{'D','E','F','3'},{'G','H','I','4'},{'J','K','L','5'},{'M','N','O','6'},{'P','R','S','7'},{'T','U','V','8'},{'W','X','Y','9'}}; for(int i=0;i<10;i++) for(int j=0;j<4;j++) if(b[i][j]==c) return (char)(i+48); return -1; } int main(){ // ifstream in("POJ_1002.txt"); // ofstream out("POJ_1002_out.txt"); map<string,int> map2; map<string,int>::iterator p; char a[100]; char b[100]; int n; // in>>n; scanf("%d",&n); for(int i=0;i<n;i++){ // in>>a; scanf("%s",a); memset(b,0,sizeof(b)); int len=strlen(a),t=0; for(int j=0;j<len;j++){ if(f(a[j])!=-1) { b[t++]=f(a[j]); } else continue; } map2[b]=map2[b]+1; } int flag=1; for(p=map2.begin();p!=map2.end();p++) if((*p).second>=2) { cout<<(*p).first.substr(0,3)<<"-"<<(*p).first.substr(3,4)<<" "<<(*p).second<<endl; flag=0; } if(flag) cout<<"No duplicates."<<endl; return 0; }
相关文章推荐
- POJ 1002 487-3279
- POJ水题1002 487-3279
- POJ 1002 487-3279
- POJ 1002题 487-3279 代码
- POJ 1002 487-3279
- POJ 1002 487-3279
- poj1002 487-3279(STL map应用)
- poj_1002_487-3279
- 【POJ 1002】487-3279
- POJ 1002 487-3279
- POJ-1002 487-3279 模拟问题
- poj 1002 487-3279 ((含易错点、测试数据) 简单模拟 )
- POJ1002 SDUT1001 487-3279 ACM算法设计
- POJ 1002 487-3279 map +暴力
- POJ1002 487-3279
- 【POJ】1002 - 487-3279
- POJ-1002-487-3279-解题报告
- POJ-1002-(487-3279)
- POJ 1002 487-3279
- POJ-1002-487-3279