POJ-1002 487-3279(map)
2017-01-21 21:39
519 查看
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
通过这道题目,把Map函数好好的学了下。
题目意思,输出转换后出现次数多于1的数字串。
如果没有的话,输出“没有重复”。
下面源代码:
750~850ms之间
参考了http://blog.csdn.net/niushuai666/article/details/6975760
Time Limit: 2000MS | Memory Limit: 65536K | |
Total Submissions: 285423 | Accepted: 51262 |
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
通过这道题目,把Map函数好好的学了下。
题目意思,输出转换后出现次数多于1的数字串。
如果没有的话,输出“没有重复”。
下面源代码:
#include <iostream> #include <stdio.h> #include <string.h> #include <string> #include <ctype.h> #include <map> using namespace std; int num[26]= { 2,2,2,3,3,3,4,4,4,5,5,5,6,6,6,7,0,7,7,8,8,8,9,9,9 };//注意有几个字母没有转化值 map<int,int>s; char buf[101];//实际上开16就可以了。 int main() { int t; scanf("%d",&t);//while(~scanf("%d",&t))并且清空容器 int flag=0; for(int i=0;i<t;i++) { scanf("%s",buf); int c=0; for(int j=0;j<strlen(buf);j++) { if(isdigit(buf[j]))//判断是数字后进行位数的运算。 c=c*10+buf[j]-48; else if(isalpha(buf[j]))//字母转化为数字后进行位数的运算。 c=c*10+num[buf[j]-'A']; } s[c]++;//c确定first后由second计数 } map<int,int>::iterator iter; for(iter=s.begin();iter!=s.end();iter++) { if(iter->second>1) { flag=1; printf("%03d-%04d %d\n",iter->first/10000,iter->first%10000,iter->second); } } if(!flag) printf("No duplicates.\n");// return 0; }
750~850ms之间
参考了http://blog.csdn.net/niushuai666/article/details/6975760
相关文章推荐
- POJ 1002 487-3279(map应用)
- 【String+Map版】从poj 1002——487-3279的STL做法和若干陷阱来分析MAP
- POJ 1002 487-3279 MAP||Sort
- poj 1002 487-3279(使用STL map)
- poj 1002 487-3279(map)
- poj 1002(487-3279)STL中的map
- POJ 1002 487-3279(Map)
- POJ 1002 487-3279(map映照容器的使用)
- poj 1002 487-3279 map的使用
- POJ 1002 487-3279(map)
- poj 1002 487-3279之map解法
- POJ1002 487-3279(map映射)
- poj 1002 487-3279
- poj 1002 487-3279 // hoj 1347 487-3279
- poj - 1002 - 487-3279(基数排序)
- POJ 1002 487-3279
- POJ 1002 487-3279
- POJ 1002 487-3279
- POJ1002 487-3279,电话号码转换
- poj 1002 487-3279